Subword complexity and Laurent series with coefficients in a finite field

Details Subword complexity and Laurent series with coefficients in a finite field Subword complexity and Laurent series with coefficients in a finite field

2010-01-14

arxiv.org/abs/1001.2548v1

Mathematics

Number Theory

Scientific paper

Decimal expansions of classical constants such as $\sqrt2$, $\pi$ and $\zeta(3)$ have long been a source of difficult questions. In the case of Laurent series with coefficients in a finite field, where no carry-over difficulties appear, the situation seems to be simplified and drastically different. On the other hand, Carlitz introduced analogs of real numbers such as $\pi$, $e$ or $\zeta(3)$. Hence, 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 $\pi$, $\Pi_q$, has in general a linear complexity, except in the case $q=2$, when the complexity is quadratic. In particular, this implies the transcendence of $\Pi_2$ over $\F_2(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.

Affiliated with

Also associated with

No associations

Rating

Subword complexity and Laurent series with coefficients in a finite field does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Subword complexity and Laurent series with coefficients in a finite field, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Subword complexity and Laurent series with coefficients in a finite field will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-355368