paper

Freeness and -arithmeticity of rational Möbius groups

arXiv:2203.17201

Abstract

We initiate a new, computational approach to a classical problem: certifying non-freeness of (-generator, parabolic) Mö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ö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 .