SearcharxivSearch

arXiv · 2608.13414

Synthetic Buildings for Finite Groups

Abstract

We introduce synthetic buildings for each finite group $G$ and prime $p$. These are $G$-simplicial complexes, among which are the $p$-subgroups complex of K.S. Brown, and also the buildings of finite groups of Lie type in characteristic $p$. Synthetic buildings are useful because of special properties, including providing a formula for the cohomology of $G$. Our goal is to describe the kinds of synthetic buildings that can arise, and ideally to classify them. The \textit{minimal} synthetic buildings play a special role and for most groups there are not very many of these. However, we show that it is possible to find sequences of finite groups with increasingly many minimal synthetic buildings as we move along the sequence, and also groups with minimal synthetic buildings of different dimensions. It is also possible to find groups with infinitely many non-minimal synthetic buildings of a given dimension. In other situations, we show that there are no minimal synthetic buildings of equivariant homotopy type distinct from those of Brown's complex and the complex consisting of a single point. We make a number of conjectures.

Explore related subjects

Keep this discovery

BibTeXRIS

Emily Gullerud, Peter Webb. 2026-08-13. Synthetic Buildings for Finite Groups. https://arxiv.org/abs/2608.13414

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