Enumerating Kleinian Groups

In this manuscript, we give an overview of the tools and techniques needed for successfully classifying “low-complexity” Kleinian groups. In particular, we focus on extracting topological and geometric properties of discrete Kleinian groups, such as bounds on tube radii, cusp geometry, volume, relators in group presentation, and similar quantities. A key point of this manuscript is to explain how a discrete set of solutions (or their closure) can be found using continuous methods, in particular by searching over a continuous parameter space of groups. These methods provide an effective avenue for studying and classifying hyperbolic 3-manifolds that satisfy some geometric or topological constraints.