Freeness and $S$-arithmeticity of rational M\"{o}bius groups
A. S. Detinko, D. L. Flannery, A. Hulpke

TL;DR
This paper develops computational methods to determine non-freeness of certain M"obius groups over rationals, using algorithms for Zariski dense groups and group presentations, revealing structural properties and finite index relations.
Contribution
It introduces a new computational approach to certify non-freeness of rational M"obius groups and computes their minimal finite index subgroups within $ ext{SL}(2,R)$.
Findings
Established criteria for non-freeness based on finite index in $ ext{SL}(2,R)$
Developed algorithms for computing presentations of $ ext{SL}(2,R)$
Identified minimal finite index subgroups containing the M"obius groups
Abstract
We initiate a new, computational approach to a classical problem: certifying non-freeness of (-generator, parabolic) M\"{o}bius subgroups of . The main tools used are algorithms for Zariski dense groups and algorithms to compute a presentation of for a localization of . We prove that a M\"{o}bius subgroup is not free by showing that it has finite index in the relevant . Further information about the structure of is obtained; for example, we compute the minimal subgroup of finite index in that contains .
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Mathematical Dynamics and Fractals · Algebraic Geometry and Number Theory
