A better proof of the Goldman-Parker conjecture
classification
🧮 math.GR
math.GT
keywords
proofconjecturegoldman-parkerbetterc-reflectionclassifiescomplexcomputer
read the original abstract
The Goldman-Parker Conjecture classifies the complex hyperbolic C-reflection ideal triangle groups up to discreteness. We proved the Goldman-Parker Conjecture in [Ann. of Math. 153 (2001) 533--598] using a rigorous computer-assisted proof. In this paper we give a new and improved proof of the Goldman-Parker Conjecture. While the proof relies on the computer for extensive guidance, the proof itself is traditional.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.