SearcharxivSearch

arXiv · 1010.0486

The reflective Lorentzian lattices of rank 3

Abstract

We classify all the symmetric integer bilinear forms of signature (2,1) whose isometry groups are generated up to finite index by reflections. There are 8595 of them up to scale, whose 374 distinct Weyl groups fall into 39 commensurability classes. This extends Nikulin's enumeration of the strongly square-free cases. Our technique is an analysis of the shape of the Weyl chamber, followed by computer work using Vinberg's algorithm and our "method of bijections". We also correct a minor error in Conway and Sloane's definition of their canonical 2-adic symbol.

Explore related subjects

Keep this discovery

BibTeXRIS

Daniel Allcock. 2010-10-04. The reflective Lorentzian lattices of rank 3. https://arxiv.org/abs/1010.0486

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