The modular group and words in its two generators

Abstract

Consider the full modular group PSL2(Z) with presentation U,S|U3,S2. Motivated by our investigations on quasi-modular forms and the Minkowski question mark function (so that this paper might be considered as a necessary appendix), we are lead to the following natural question. Some words in the alphabet \U,S\ are equal to the unity; for example, USU3SU2 is such a word of length 8, and USU3SUSU3S3U is such a word of length 15. Given n∈N0. Find the number of words of length n which are equal to the unity. 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 Q(x) of degree 3. As an aside, we formulate the problem of describing all algebraic functions with a Fermat property.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…