【24h】

SUBWORD COMPLEXITY AND LAURENT SERIES

机译:次字复杂性和Laurent系列

获取原文
           

摘要

Decimal expansions of classical constants such as √2, π and ζ(3) have long been a source of difficult questions. In the case of Laurent series with coefficients in a finite field, where “no carries appear,” the situation seems to be simplified and drastically different. In 1935 Carlitz introduced analogs of real numbers such as π, e or ζ(3) and it became reasonable to enquire how “complex” the Laurent representation of these “numbers” is. In this paper we prove that the inverse of Carlitz’s analog of π, Πq, has, in general, linear subword complexity, except in the case q = 2, when the complexity is quadratic. In particular, this gives a new proof of the transcendence of Π2 over F2(T). In the second part, we consider the classes of Laurent series of at most polynomial complexity and of zero entropy. We show that these satisfy some nice closure properties.
机译:典型常数等十进制扩展,如√2,π和ζ(3)长期以来一直是难题的源泉。在有限田中的带有系数的Laurent系列的情况下,在其中“没有带来的情况下”,情况似乎是简化和急剧不同的。 1935年Carlitz引入了真实数字的类似物,如π,e或ζ(3),并且可以合理地查询这些“数字”的劳伦表达方式。在本文中,我们证明了Carlitz的π,πq的模拟的倒数,通常是线性子字复杂性,除Q = 2外,当复杂性是二次的时。特别是,这给出了F2(T)上π2的超越的新证据。在第二部分中,我们考虑了最多多项式复杂性和零熵的劳伦辛系列的类。我们表明这些满足了一些漂亮的封闭物质。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号