The non-Euclidean Euclidean algorithm

DOI10.1016/j.aim.2013.09.012zbMath1351.51016arXiv1207.1062OpenAlexW2964052832MaRDI QIDQ2445379

Jane Gilman

Publication date: 14 April 2014

Published in: Advances in Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsFuchsian groupshyperbolic geometrydiscreteness criteriaTeichmüller theory

Mathematics Subject Classification ID

Hyperbolic and elliptic geometries (general) and generalizations (51M10) Moduli of Riemann surfaces, Teichmüller theory (complex-analytic aspects in several variables) (32G15) Fuchsian groups and their generalizations (group-theoretic aspects) (20H10)

Related Items

Computability Models: Algebraic, Topological and Geometric Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumerating palindromes and primitives in rank two free groups.
• Elementary geometry in hyperbolic space
• Rational powers of generators of Möbius groups
• Algorithms, complexity and discreteness criteria in \(PSL(2,C)\)
• The geometry of two generator groups: hyperelliptic handlebodies
• Two generator discrete free products
• Two generator Fuchsian groups of genus one
• An algorithm for 2-generator Fuchsian groups
• Discreteness criteria and the hyperbolic geometry of palindromes
• Two-generator discrete subgroups of 𝑃𝑆𝐿(2,𝑅)