Geometric algorithms for discreteness and faithfulness
DOI10.1090/CONM/783/15736OpenAlexW4323646357MaRDI QIDQ5886549FDOQ5886549
Authors: Michael Kapovich 
Publication date: 5 April 2023
Published in: Computational Aspects of Discrete Subgroups of Lie Groups (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/conm/783/15736
Recommendations
- Algorithms, complexity and discreteness criteria in \(PSL(2,C)\)
- Computability Models: Algebraic, Topological and Geometric Algorithms
- A discreteness algorithm for 4-punctured sphere groups
- The constructive membership problem for discrete free subgroups of rank 2 of \(\mathrm{SL}_2(\mathbb R)\).
- scientific article; zbMATH DE number 1760347
Hyperbolic groups and nonpositively curved groups (20F67) Discrete subgroups of Lie groups (22E40) Differential geometry of symmetric spaces (53C35) Computational methods for problems pertaining to group theory (20-08)
Cites Work
- An exposition of Poincaré's polyhedron theorem
- Geometrical finiteness for hyperbolic groups
- Title not available (Why is that?)
- Anosov representations: domains of discontinuity and applications.
- Anosov flows, surface groups and curves in projective space
- Geometric group theory. With an appendix by Bogdan Nica
- Applications of a Computer Implementation of Poincare's Theorem on Fundamental Polyhedra
- Two-generator discrete subgroups of 𝑃𝑆𝐿(2,𝑅)
- Geometrical finiteness with variable negative curvature
- Computing arithmetic Kleinian groups
- An algorithm for 2-generator Fuchsian groups
- Algorithms, complexity and discreteness criteria in \(PSL(2,C)\)
- COMPUTATION IN WORD-HYPERBOLIC GROUPS
- A Morse lemma for quasigeodesics in symmetric spaces and Euclidean buildings
- Generic thinness in finitely generated subgroups of \(\mathrm{SL}_n (\mathbb Z)\)
- Geometric finiteness in negatively pinched Hadamard manifolds
- Discrete isometry groups of symmetric spaces
- Foundations of hyperbolic manifolds
- Discreteness is undecidable
- Some Computer-Assisted Topological Models of Hilbert Fundamental Domains
- Computing a generating set of arithmetic Kleinian groups
- Title not available (Why is that?)
Cited In (11)
- Fast Algorithms for Geometric Consensuses
- Computability Models: Algebraic, Topological and Geometric Algorithms
- Verifying the Straight-and-spaced Condition
- An orderly algorithm and some applications in finite geometry
- The Geometry of Algorithms with Orthogonality Constraints
- A discreteness algorithm for 4-punctured sphere groups
- Geometry of Selberg's bisectors in the symmetric space \(SL(n, \mathbb{R})/SO(n, \mathbb{R})\)
- A note on properly discontinuous actions
- Correction to: ``A note on properly discontinuous actions
- Two design principles of geometric algorithms in finite-precision arithmetic
- Geometric Computations on Indecisive Points
This page was built for publication: Geometric algorithms for discreteness and faithfulness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886549)
