SearcharxivSearch

arXiv · 1512.01133

The classification of Rank 3 Reflective Hyperbolic Lattices over Z[\sqrt{2}]

Abstract

There are 432 strongly squarefree symmetric bilinear forms of signature $(2,1)$ defined over $\Z[\sqrt{2}]$ whose integral isometry groups are generated up to finite index by finitely many reflections. We adapted Allcock's method (based on Nikulin's) of analysis for the $2$-dimensional Weyl chamber to the real quadratic setting, and used it to produce a finite list of quadratic forms which contains all of the ones of interest to us as a sub-list. The standard method for determining whether a hyperbolic reflection group is generated up to finite index by reflections is an algorithm of Vinberg. However, for a large number of our quadratic forms the computation time required by Vinberg's algorithm was too long. We invented some alternatives, which we present here.

Explore related subjects

Keep this discovery

BibTeXRIS

Alice Mark. 2015-12-03. The classification of Rank 3 Reflective Hyperbolic Lattices over Z[\sqrt{2}]. https://doi.org/10.1017/s0305004116000979

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR