Optimal independent generating system for the congruence subgroups $\Gamma_0(p)$ and $\Gamma_0(p^2)$
Nhat Minh Doan, Sang-hyun Kim, Mong Lung Lang, Ser Peow Tan

TL;DR
This paper constructs explicit free product decompositions for congruence subgroups _0(n) with controlled generators, confirming a conjecture and providing geometric and algebraic bounds related to Farey sequences and hyperbolic polygons.
Contribution
It proves a conjecture of Kulkarni by providing explicit free product decompositions of _0(n) with specific generator properties and establishes bounds on the minimal largest denominator in associated cusp sets.
Findings
_0(n) admits a free product decomposition into cyclic factors with controlled components.
Bounds on the minimal largest denominator in cusp sets are established and characterized.
The geometric structure of the hyperbolic convex hull relates to the algebraic decomposition of _0(n).
Abstract
Let be a prime or its square. We prove that the congruence subgroup admits a free product decomposition into cyclic factors in such a way that the -component of each cyclic generator is either or , answering a conjecture of Kulkarni. We can also require that the Frobenius norm of each generator is less than . A crucial observation is that if denotes the convex hull of the extended Farey sequence of order in the hyperbolic plane , then the projection is injective on the interior of and each connected component of is either an order-three cone of area or an ideal triangle. Denoting by the minimum of the largest denominator in the cusp set of where ranges over all possible special…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Algebraic Geometry and Number Theory
