Introduction The acute triangle theorem Discreteness theorem proof outline
Preliminaries Triangle groups and their tilings Pentagons Hyperbolic formulae & geometry Extending Knapp & Poincare
Geometric equivalence and the discreteness theorem The standard acute triangles Nielsen eq: $(2,3,n)t=3; k=3$ Nielsen eq: $(2,4,n)t=2; k=2$ Pentagon $t=9$ & 2-2 spectrum The seven & geometric eq $t=9$ Discreteness theorem proof
The real number algorithm and the Turing machine algorithm Forms of the algorithm
Appendix Verify Matelski-Beardon count A summary of notation
Table of Contents provided by Publisher. All Rights Reserved.
What is included with this book?
The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.
Please wait while the item is added to your bag...