Connectivity of $p$-subgroup posets with irreducible characters
Group Theory
2025-12-30 v1 Combinatorics
Abstract
Let be a finite group. For a prime and an integer , we denote by the set of all pairs , where is a -subgroup of of order greater than and is a complex irreducible character of . In this paper, we investigate the connected components of the poset . For the case , we prove that is disconnected if and only if either has a strongly -embedded subgroup, or every Sylow -subgroup of contains a unique subgroup of order . Furthermore, for and a -group, we show that the number of connected components of equals the order of the intersection of all subgroups of of order .
Cite
@article{arxiv.2512.22410,
title = {Connectivity of $p$-subgroup posets with irreducible characters},
author = {Hangyang Meng and Yuting Yang},
journal= {arXiv preprint arXiv:2512.22410},
year = {2025}
}
Comments
16 pages