SearcharxivSearch

arXiv · math/0012266

Extended F_4-buildings and the Baby Monster

Abstract

The Baby Monster group B acts naturally on a geometry E(B) with diagram c.F_4(t) for t=4 and the action of B on E(B) is flag-transitive. It possesses the following properties: (a) any two elements of type 1 are incident to at most one common element of type 2, and (b) three elements of type 1 are pairwise incident to common elements of type 2 iff they are incident to a common element of type 5. It is shown that E(B) is the only (non-necessary flag-transitive) c.F_4(t)-geometry, satisfying t=4, (a) and (b), thus obtaining the first characterization of B in terms of an incidence geometry, similar in vein to one known for classical groups acting on buildings. Further, it is shown that E(B) contains subgeometries E(^2E_6(2)) and E(Fi22) with diagrams c.F_4(2) and c.F_4(1). The stabilizers of these subgeometries induce on them flag-transitive actions of ^2E_6(2):2 and Fi22:2, respectively. Three further examples for t=2 with flag-transitive automorphism groups are constructed. A complete list of possibilities for the isomorphism type of the subgraph induced by the common neighbours of a pair of vertices at distance 2 in an arbitrary c.F_4(t) satisfying (a) and (b) is obtained.

Explore related subjects

Keep this discovery

BibTeXRIS

A. A. Ivanov, D. V. Pasechnik, S. V. Shpectorov. 2000-12-29. Extended F_4-buildings and the Baby Monster. https://doi.org/10.1007/pl00005804

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