Combinatorial Structure of Inert and Ambiguous Classes in Modular Group
Abstract
We study inert, and ambiguous conjugacy classes in the modular group $\mathrm{PSL}(2,\mathbb{Z})$ from a purely combinatorial perspective. Using word length in the free product representation $\mathbb{Z}_2 * \mathbb{Z}_3$ of the modular group, we obtain exact counting formulas and asymptotic growth rates for inert and ambiguous classes. Our results provide the first counting formulas for inert classes obtained independently of Sarnak's analytic trace-based methods, while also establishing a combinatorial framework for ambiguous classes.
Fields of Study & Subjects
Advanced Algebra and Geometry
Geometric and Algebraic Topology
Finite Group Theory Research
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 22 February 2026
- Language
- EN
- Document type
- Preprint