Algorithms, complexity and discreteness criteria in \(PSL(2,C)\)
type: Item
instance of: scholarly article
title: Algorithms, complexity and discreteness criteria in \(PSL(2,C)\)
zbMATH Open document ID: 0903.68102
DOI: 10.1007/BF02788139
author: Jane Gilman
published in: Journal d'Analyse Mathématique
publication date: 1998-04-26T00:00:00Z
review text: In the paper, the discreteness problem for subgroups of \(\text{PSL}(2,\mathbb{C})\) is studied. As the main result the computational complexity of the rational number algorithm for \(\text{PSL}(2,\mathbb{Q})\), the real number algorithm for \(\text{PSL}(2,\mathbb{R})\), and the Turing machine algorithm for \(\text{PSL}(2, \mathbb{Q}(\gamma))\) is determined. Also the computational complexity of Riley's \(\text{PSL}(2,\mathbb{C})\) procedure and Jørgenson's inequality is investigated.
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 20G20
zbMATH DE Number: 1146562
zbMATH Keywords: discreteness problem
zbMATH Keywords: Turing machine algorithm
zbMATH Keywords: computational complexity
reviewed by: Karl-Heinz Zimmermann
MaRDI profile type: Publication
cites work: Q4091421
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Q4190138
cites work: Computer Algebra of Polynomials and Rational Functions
cites work: Two-generator discrete subgroups of 𝑃𝑆𝐿(2,𝑅)
cites work: An algorithm for 2-generator Fuchsian groups
cites work: On Discrete Groups of Mobius Transformations
cites work: Computing Rational Zeros of Integral Polynomials by p-Adic Expansion
cites work: The classification of discrete 2-generator subgroups of PSL(2,R)
cites work: Applications of a Computer Implementation of Poincare's Theorem on Fundamental Polyhedra
cites work: All generating pairs of all two-generator Fuchsian groups
cites work: Q3883493
full work available at URL: https://doi.org/10.1007/bf02788139
OpenAlex ID: W2041963372
description: scientific article; zbMATH DE number 1146562