SearcharxivSearch

arXiv · 1409.0184

Prenilpotent pairs in the E10 root system

Abstract

Tits has defined Kac-Moody groups for all root systems, over all commutative rings with unit. A central concept is the idea of a prenilpotent pair of (real) roots. In particular, writing down his group presentation explicitly would require knowing all the Weyl-group orbits of such pairs. We show that for the hyperbolic root system E10 there are so many orbits that any attempt at direct enumeration is impractical. Namely, the number of orbits of prenilpotent pairs having inner product k grows at least as fast as (constant)(7th power of k). Our purpose is to motivate alternate approaches to Tits' groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Daniel Allcock. 2014-08-31. Prenilpotent pairs in the E10 root system. https://arxiv.org/abs/1409.0184

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