## Functiones et Approximatio Commentarii Mathematici

### Hausdorff dimension of the recurrence sets of Gauss transformation on the field of Laurent series

#### Abstract

Define the recurrence set of Gauss transformation $T$ on the field of Laurent series as following $$E(x_0)=\{x\in I: T^n(x)\in I_{t_n}(x_0) for infinitely many n\},$$ where $I_{t_n}(x_0)$ denotes $t_n$-th order cylinder of $x_0$. In this paper, the Hausdorff dimension of the set $E(x_0)$ is determined.

#### Article information

Source
Funct. Approx. Comment. Math., Volume 43, Number 2 (2010), 161-170.

Dates
First available in Project Euclid: 9 December 2010

https://projecteuclid.org/euclid.facm/1291903395

Digital Object Identifier
doi:10.7169/facm/1291903395

Mathematical Reviews number (MathSciNet)
MR2767168

Zentralblatt MATH identifier
1222.11099

#### Citation

Zhang, Lan; Wang, Sikui. Hausdorff dimension of the recurrence sets of Gauss transformation on the field of Laurent series. Funct. Approx. Comment. Math. 43 (2010), no. 2, 161--170. doi:10.7169/facm/1291903395. https://projecteuclid.org/euclid.facm/1291903395

#### References

• E. Artin, Quadratische Köper im Gebiete der höeren Kongruenzen, I-II, Math. Z. 19 (1924), 153--46.
• V. Berthé, H. Nakada, On continued fraction expansions in positive characteristic: equivalence relations and some metric properties, Exposition Math. 4 (2000), 257--284.
• K. J. Falconer, Fractal Geometry, Mathematical Foundations and Application, Wiley, 1990.
• J. L. Fernández, M. V. Melián, Quantitative recurrence properties of expanding maps, Arxiv preprint math.DS/0703222, (2007).
• M. Fuchs, On metric Diophantine approximation in the field of formal Laurent series, Finite Fields Appl. 8 (2002), 343--368.
• X. H. Hu et al. Cantor sets determined by partial quotients of continued fractions of Laurent series, Finite Fields Appl. 14 (2008), 417--437.
• S. Kristensen, On well-approximable matrices over a field of formal series, Math. Proc. Cambridge Philos. Soc. 2 (2003), 255--268.
• H. Niederreiter, The probabilistic theory of linear complexity, in: C.G. Gnther (Ed.), Advances in CryptologyEUROCRYPT88, Lecture Notes in Computer Science, 330 (1988), 191--209.
• H. Niederreiter, M. Vielhaber, Linear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles, J. Complexity, 3 (1997), 353--383.
• B. Saussol, S. Troubetzkoy, S. Vaienti, Recurrence, dimensions and Lyapunov exponents, J. Stat. Phys. 106 (2002), 623--634.
• W.M. Schmidt, On continued fractions and Diophantine approximation in power series fields, Acta Arith. 95 (2000), 139--166.
• J. Wu, On the sum of degrees of digits occurring in continued fraction expansions of Laurent series, Math. Proc. Cambridge Philos. Soc. 138 (2005), 9--20.