Numbers of classes and chains of subgroups in finite groups (Q1270093): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jabr.1998.7430 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2150346619 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Möbius function of a finite group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On local control of the number of conjugacy classes / rank | |||
Normal rank |
Latest revision as of 16:59, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Numbers of classes and chains of subgroups in finite groups |
scientific article |
Statements
Numbers of classes and chains of subgroups in finite groups (English)
0 references
7 March 1999
0 references
Let \(X\) be a normal subset of a finite group \(G\), and let \(m_N(V)\) denote the number of conjugacy classes of \(N\) contained in \(V\cap X\), for subgroups \(V\subseteq N\subseteq N_G(V)\subseteq G\). Moreover, let \(\mathcal F\) be a conjugation-invariant collection of subgroups of \(G\) such that each element \(x\in X\) is contained in a unique smallest member \(F_x\in{\mathcal F}\). Finally, let \(\mathcal S\) denote the \(G\)-poset of nonempty chains in \(\mathcal F\), and let \(G_\sigma\) denote the stabilizer and \(V_\sigma\) the smallest member of a chain \(\sigma\in{\mathcal S}\). The author shows that \(m_G(G)=\sum_{\sigma\in{\mathcal S}}(-1)^{|\sigma|+1} m_{G_\sigma}(V_\sigma)/| G:G_\sigma|\). This, together with a related theorem, generalizes earlier results by \textit{G. Robinson} and this reviewer [e.g., J. Algebra 205, No. 1, 326-332 (1998)]. The proofs are elementary and simplify the earlier representation-theoretic approach.
0 references
Möbius function
0 references
numbers of conjugacy classes
0 references
posets
0 references
chains
0 references