Advertisement

Lithuanian Mathematical Journal

, Volume 57, Issue 1, pp 1–12 | Cite as

The modular group and words in its two generators*

  • Giedrius Alkauskas
Article
  • 52 Downloads

Abstract

Consider the full modular group PSL2(ℤ) with presentation 〈U, S|U 3, S 2〉. Motivated by our investigations on quasi-modular forms and the Minkowski question mark function (so that this paper may be considered as a necessary appendix), we are led to the following natural question. Some words in the alphabet {U, S} are equal to the unity; for example, USU 3 SU 2 is such a word of length 8, and USU 3 SUSU 3 S 3 U is such a word of length 15. We consider the following integer sequence. For each n ∈ ℕ0, let t(n) be the number of words in the alphabet {U, S} that equal the identity in the group. This is the new entry A265434 into the Online Encyclopedia of Integer Sequences. We investigate the generating function of this sequence and prove that it is an algebraic function over ℚ(x) of degree 3. As an interesting generalization, we formulate the problem of describing all algebraic functions with a Fermat property.

Keywords

the modular group combinatorial group theory free group unity generating function algebraic function cogrowth rate return generating function word problem pushdown automaton 

MSC

05A05 05A15 20XX 14H05 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    G. Alkauskas, The Minkowski ?(x) function, a class of singular measures, quasi-modular and mean-modular forms, http://arxiv.org/abs/1209.4588.
  2. 2.
    L. Bartholdi, Counting paths in graphs, Enseign. Math. (2), 45(1–2):83–131, 2005.Google Scholar
  3. 3.
    S.R. Finch, Mathematical Constants, Encycl. Math. Appl., Vol. 94, Cambridge University Press, Cambridge, 2003.Google Scholar
  4. 4.
    J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley Series in Computer Science, Addison-Wesley, Reading, MA, 1979.Google Scholar
  5. 5.
    D.G. Kouksov, On rationality of the cogrowth series, Proc. Am. Math. Soc., 126(10):2845–2847, 1998.MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    D. Kuksov, Cogrowth series of free products of finite and free groups, Glasgow Math. J., 41(1):19–31, 1999.MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    F. Lehner, On the computation of spectra in free probability, J. Funct. Anal., 183(2):451–471, 2001.MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    J.C. McLaughlin, RandomWalks and Convolution Operators on Free Products, PhD dissertation, New York University, 1986.Google Scholar
  9. 9.
    G. Quenell, Combinatorics of free product graphs, in R. Brooks, C. Gordon, and P. Perry (Eds.), Geometry of the Spectrum. 1993 Joint Summer Research Conference on Spectral Geometry, July 17–23, University of Washington, Seattle, Contemp. Math., Vol. 173, AMS, Providence, RI, 1994, pp. 257–281.Google Scholar
  10. 10.
    D. Voiculescu, Addition of certain noncommuting random variables, J. Funct. Anal., 66(3):323–346, 1986.MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    W. Woess, Nearest neighbour random walks on free products of discrete groups, Boll. Unione Mat. Ital., VI Ser., B, 5(3):961–982, 1986.MathSciNetMATHGoogle Scholar
  12. 12.
    W. Woess, Random walks on infinite graphs and groups, Camb. TractsMath., Vol. 138, Cambridge University Press, Cambridge, 2000.Google Scholar
  13. 13.
    The Online Encyclopedia of Integer Sequences, Sequence A265434, http://oeis.org/.

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  1. 1.Faculty of Mathematics and InformaticsVilnius UniversityLT-03225Lithuania

Personalised recommendations