SearcharxivSearch

arXiv · 2204.13055

Some results on Quillen's Conjecture via equivalent-poset techniques

Abstract

We extend the Main Theorem of Aschbacher and Smith on Quillen's Conjecture from $p>5$ to the remaining odd primes $p = 3,5$. In the process, we develop further combinatorial and homotopical methods for studying the poset of nontrivial elementary abelian $p$-subgroups of a finite group. The techniques lead to a number of further results on the Conjecture, often reducing dependence on the CFSG; in particular, we also provide some partial results toward the case of $p=2$.

Explore related subjects

Keep this discovery

BibTeXRIS

Kevin I. Piterman, Stephen D. Smith. 2022-04-27. Some results on Quillen's Conjecture via equivalent-poset techniques. https://arxiv.org/abs/2204.13055

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