Algorithms, complexity and discreteness criteria in \(PSL(2,C)\)

DOI10.1007/BF02788139zbMath0903.68102OpenAlexW2041963372MaRDI QIDQ1385406

Jane Gilman

Publication date: 26 April 1998

Published in: Journal d'Analyse Mathématique (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02788139

zbMATH Keywords

computational complexitydiscreteness problemTuring machine algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear algebraic groups over the reals, the complexes, the quaternions (20G20)

Related Items (7)

Computability Models: Algebraic, Topological and Geometric Algorithms ⋮ Geometric algorithms for discreteness and faithfulness ⋮ List of problems on discrete subgroups of Lie groups and their computational aspects ⋮ Enumerating palindromes and primitives in rank two free groups. ⋮ The non-Euclidean Euclidean algorithm ⋮ Jörgensen’s inequality and purely loxodromic two-generator free Kleinian groups ⋮ A discreteness algorithm for 4-punctured sphere groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• All generating pairs of all two-generator Fuchsian groups
• The classification of discrete 2-generator subgroups of PSL(2,R)
• An algorithm for 2-generator Fuchsian groups
• Applications of a Computer Implementation of Poincare's Theorem on Fundamental Polyhedra
• Computing Rational Zeros of Integral Polynomials by p-Adic Expansion
• On Discrete Groups of Mobius Transformations
• Computer Algebra of Polynomials and Rational Functions
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Two-generator discrete subgroups of 𝑃𝑆𝐿(2,𝑅)

This page was built for publication: Algorithms, complexity and discreteness criteria in \(PSL(2,C)\)