SearcharxivSearch

arXiv · 2602.21005

Non-linearizable Root Group Data

Abstract

An RGD system $\mathcal{D}$ is called \emph{linear w.r.t. a root basis $\mathcal{B}$} if the commutation relations between the root groups of $\mathcal{D}$ are `linear' in a certain sense. Moreover, $\mathcal{D}$ is called \emph{linearizable}, if there exists a root basis $\mathcal{B}$ such that $\mathcal{D}$ is linear w.r.t. $\mathcal{B}$. For many examples of RGD systems it is easy to see that they are linear w.r.t. a concrete root basis. To the best of our knowledge, it was unclear whether RGD systems exist which are not linearizable. In this article we show that there exist uncountably many RGD systems which are not linearizable. In particular, we provide the first explicit example of such an RGD system. This expands the quote from R\'{e}my that axiom (RGD$1$)$_{\mathrm{lin}}$ is not only a strengthening of axiom (RGD$1$), but is in fact stronger than it. We show that non-linearizability appears in examples of universal type, and also in examples of $2$-spherical type. For the examples of universal type we construct an uncountable family of non-linearizable RGD systems, and for the examples of $2$-spherical type we show that the RGD systems of type $(4, 4, 4)$ recently constructed by the author provide uncountably many non-linearizable RGD systems.

Explore related subjects

Keep this discovery

BibTeXRIS

Sebastian Bischof. 2026-02-24. Non-linearizable Root Group Data. https://arxiv.org/abs/2602.21005

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