The Boca-Cobeli-Zaharescu Map Analogue for the Hecke Triangle Groups Gq

Abstract

The Farey sequence F(Q) at level Q is the sequence of irreducible fractions in [0, 1] with denominators not exceeding Q, arranged in increasing order of magnitude. A simple ``next-term'' algorithm exists for generating the elements of F(Q) in increasing or decreasing order. That algorithm, along with a number of other properties of the Farey sequence, was encoded by F. Boca, C. Cobeli, and A. Zaharescu into what is now known as the Boca-Cobeli-Zaharescu (BCZ) map, and used to attack several problems that can be described using the statistics of subsets of the Farey sequence. In this paper, we derive the Boca-Cobeli-Zaharescu map analogue for the discrete orbits q = Gq(1, 0)T of the linear action of the Hecke triangle groups Gq on the plane R2 starting with a Stern-Brocot tree analogue for the said orbits. We derive the next-term algorithm for generating the elements of q in vertical strips in increasing order of slope, and present a number of applications to the statistics of q.

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…