2000 character limit reached
On Gehring-Martin-Tan groups with an elliptic generator
Published 16 Sep 2016 in math.GT and math.GR | (1609.05044v1)
Abstract: The Gehring-Martin-Tan inequality for 2-generator subgroups of PSL(2,C) is one of the best known discreteness conditions. A Kleinian group $G$ is called a Gehring-Martin-Tan group if the equality holds for the group $G$. We give a method for constructing Gehring-Martin-Tan groups with a generator of order four and present some examples. These groups arise as groups of finite volume hyperbolic 3-orbifolds.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.