SearcharxivSearch

arXiv · 1207.2266

A (very short) introduction to buildings

Abstract

These lectures are an informal elementary introduction to buildings. They are written for, and by, a non-expert. The aim is to get to the definition of a building and feel that it is an entirely natural thing. To maintain the lecture style examples have replaced proofs. The notes at the end indicate where these proofs can be found. Most of what we say has its origins in the work of Jacques Tits, and our account borrows heavily from the books of Abramenko and Brown and of Ronan. Lecture 1 illustrates all the essential features of a building in the context of an example, but without mentioning any building terminology. In principle anyone could read this. Lectures 2-4 firm-up and generalize these specifics: Coxeter groups appear in Lecture 2, chambers systems in Lecture 3 and the definition of a building in Lecture 4. Lecture 5 addresses where buildings come from by describing the first important example: the spherical building of an algebraic group.

Explore related subjects

Keep this discovery

BibTeXRIS

Brent Everitt. 2013-06-13. A (very short) introduction to buildings. https://arxiv.org/abs/1207.2266

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