Search arXivSearch

arXiv · 1908.05543

Brown's Criterion and classifying spaces for families

Abstract

Let $G$ be a group and $\mathcal{F}$ be a family of subgroups closed under conjugation and subgroups. A model for the classifying space $E_{\mathcal{F}} G$ is a $G$-CW-complex $X$ such that every isotropy group belongs to $\mathcal{F}$, and for all $H\in \mathcal{F}$ the fixed point subspace $X^H$ is contractible. The group $G$ is of type $\mathcal{F}\text{-}\mathrm{F}_{n}$ if it admits a model for $E_\mathcal{F} G$ with $n$-skeleton with compact orbit space. The main result of the article provides is a characterization of $\mathcal{F}\text{-}\mathrm{F}_{n}$ analogue to Brown's criterion for $\mathrm{FP}_n$. As applications we provide criteria for this type of finiteness properties with respect to families to be preserved by finite extensions, a result that contrast with examples of Leary and Nucinkis. We also recover L\"uck's characterization of property $\underline{\mathrm{F}}_n$ in terms of the finiteness properties of the Weyl groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Eduardo Martínez-Pedroza, Luis Jorge Sánchez Saldaña. 2019-08-15. Brown's Criterion and classifying spaces for families. https://arxiv.org/abs/1908.05543

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