Discreteness is undecidable

DOI10.1142/S0218196716500193MaRDI QIDQ2814676zbMATH OpenOpenAlexFDO

Authors Michael Kapovich

Publication date 22 June 2016

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218196716500193

zbMATH Keywords

decidabilitydiscrete subgroups

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Discrete subgroups of Lie groups (22E40)

Cites work

• Applications of a Computer Implementation of Poincare's Theorem on Fundamental Polyhedra
• Cusps in complex boundaries of one-dimensional Teichmüller space
• Discreteness is undecidable
• scientific article; zbMATH DE number 1096865 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• 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

Describes a project that uses

Uses Software

• MathOverflow

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)