A better proof of the Goldman-Parker conjecture
Richard Evan Schwartz
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.
Create a lesson
Related papers
Lifts of Brauer characters and vertex pairs for odd primes
Yong Yang
Galois's lost proof on PSL(2,p)
Péter P. Pálfy
Large orbits of p-groups on conjugacy classes
Thomas Michael Keller
Assouad--Nagata dimension of systolic complexes with almost flat intervals
Martín Blufstein, Victor Chepoi, Huaitao Gui et al.
Conjugator length of Bestvina-Brady groups
Jerónimo García-Mejía, Matteo Migliorini
Morse accessibility with applications to Coxeter groups
Matthew Cordes, Annette Karrer, Kim Ruane