SearcharxivSearch

arXiv · math/0208176

Connectivity of the coset poset

Abstract

Topological concepts may be applied to any poset via the simplicial complex of finite chains. The coset poset C(G) of a finite group G (consisting of all cosets of all proper subgroups of G, ordered by inclusion) was introduced by Kenneth S. Brown in his study of the probabilistic zeta function P(G,s), and Brown's results motivate the study of the homotopy type of C(G). After a detailed introduction to basic simplicial topology and homotopy theory for finite posets (Chapter 2), we examine the connectivity of the coset poset (Chapter 3). Of particular interest is the fundamental group, and we provide various conditions under which C(G) is or is not simply connected. In particular, we classify direct products with simply connected coset posets. In Chapter 4, we treat several specific examples, including A_5 and PSL(2,7). We prove that both of these groups have simply connected coset posets, and in fact determine the precise homotopy type of C(A_5). This chapter also includes a detailed determination of all subgroups of the groups PSL(2,p), p prime (following Burnside). The final chapter discusses conjectures and directions for further research.

Explore related subjects

Keep this discovery

BibTeXRIS

Daniel A. Ramras. 2002-09-30. Connectivity of the coset poset. https://arxiv.org/abs/math/0208176

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