Optimal Farey sequence for the Congruence subgroup 0(2n)
Abstract
We prove that 0(2n) (n2) has a Farey sequence \ei\ such that ei 2n-1 for all ei. The above upper bound is optimal, and there exists a unique j such that ej= 2n-1 . For each ei, there exists a unique ai such that \ ai/ei\ \∞\ is the set of ideal vertices of a fundamental domain of 0(2n) whose side-pairings give a set of independent generators of 0(2n).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.