SearcharxivSearch

arXiv · 1408.2439

Even More Infinite Ball Packings from Lorentzian Root Systems

Abstract

Boyd (1974) proposed a class of infinite ball packings that are generated by inversions. Later, Maxwell (1983) interpreted Boyd's construction in terms of root systems in Lorentz space. In particular, he showed that the space-like weight vectors correspond to a ball packing if and only if the associated Coxeter graph is of "level $2$." In Maxwell's work, the simple roots form a basis of the representations space of the Coxeter group. In several recent studies, the more general based root system is considered, where the simple roots are only required to be positively independent. In this paper, we propose a geometric version of "level" for the root system to replace Maxwell's graph theoretical "level." Then we show that Maxwell's results naturally extend to the more general root systems with positively independent simple roots. In particular, the space-like extreme rays of the Tits cone correspond to a ball packing if and only if the root system is of level $2$. We also present a partial classification of level-$2$ root systems, namely the Coxeter $d$-polytopes of level-$2$ with $d+2$ facets.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hao Chen. 2014-08-11. Even More Infinite Ball Packings from Lorentzian Root Systems. https://doi.org/10.37236/4989

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