SearcharxivSearch

arXiv · 2211.03257

Lattices, Garside structures and weakly modular graphs

Abstract

In this article we study combinatorial non-positive curvature aspects of various simplicial complexes with natural $\widetilde A_n$ shaped simplicies, including Euclidean buildings of type $\widetilde A_n$ and Cayley graphs of Garside groups and their quotients by the Garside elements. All these examples fit into the more general setting of lattices with order-increasing $\mathbb Z$-actions and the associated lattice quotients proposed in a previous work by the first named author. We show that both the lattice quotients and the lattices themselves give rise to weakly modular graphs, which is a form of combinatorial non-positive curvature. We also show that several other complexes fit into this setting of lattices/lattice quotients, hence our result applies, including Artin complexes of Artin-Tits groups of type $\widetilde A_n$, a class of arc complexes and weak Garside groups arising from a categorical Garside structure in the sense of Bessis. Along the way, we also clarify the relationship between categorical Garside structure, lattices with $\mathbb Z$ action and different classes of complexes studied this article. We use this point of view to describe the first examples of Garside groups with exotic properties, like non-linearity or rigidity results.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas Haettel, Jingyin Huang. 2022-11-07. Lattices, Garside structures and weakly modular graphs. https://arxiv.org/abs/2211.03257

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