Discreteness is undecidable
From MaRDI portal
In this paper it is proved that the discreteness problem for \(2\)-generated nonelementary subgroups of \(\mathrm{SL}(2,\mathbb{C})\) is undecidable in the BSS computability model.
Cites work
- Applications of a Computer Implementation of Poincare's Theorem on Fundamental Polyhedra
- Complexity and real computation. Foreword by Richard M. Karp
- Computable analysis. An introduction
- Cusps in complex boundaries of one-dimensional Teichmüller space
- Discreteness is undecidable
- On sequences of finitely generated discrete groups.
- Projective structures with degenerate holonomy and the Bers density conjecture
- Two-generator discrete subgroups of 𝑃𝑆𝐿(2,𝑅)
Cited in
(10)- On the discreteness of states accessible via right-angled paths in hyperbolic space
- Discreteness is undecidable
- A discreteness algorithm for 4-punctured sphere groups
- Undecidability of the Spectral Gap
- 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
- Verifying the Straight-and-spaced Condition
- Morse actions of discrete groups on symmetric spaces: local-to-global principle
- Certifying Anosov representations
This page was built for publication: Discreteness is undecidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2814676)
