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 .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.