A discreteness algorithm for 4-punctured sphere groups

From MaRDI portal
Publication:4965259

DOI10.1090/CONM/759/15269zbMATH Open1460.57024arXiv1910.10055OpenAlexW3112247334MaRDI QIDQ4965259FDOQ4965259


Authors: Caleb Ashley Edit this on Wikidata


Publication date: 26 February 2021

Published in: The Golden Anniversary Celebration of the National Association of Mathematicians (Search for Journal in Brave)

Abstract: Let Gamma be a subgroup of PSL(2,R) generated by three parabolic transformations. The main goal of this paper is to present an algorithm to determine whether or not Gamma is discrete. Historically discreteness algorithms have been considered within several broader mathematical paradigms: the discreteness problem, the construction and deformation of hyperbolic structures on surfaces and notions of automata for groups. Each of these approaches yield equivalent results. The second goal of this paper is to give an exposition of the basic ideas needed to interpret these equivalences, emphasizing related works and future directions of inquiry.


Full work available at URL: https://arxiv.org/abs/1910.10055




Recommendations




Cites Work


Cited In (12)





This page was built for publication: A discreteness algorithm for 4-punctured sphere groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965259)