Recognizing a finite group from the generating properties of its subsets
Assume that you do not know the group operation of some finite group \(G\), but you do know the underlying set of \(G\) and one of the following: \begin{itemize} \item for each subset \(X\subseteq G\): whether \(G=\langle X\rangle\); or \item an undirected graph isomorphic to the one whose vertices are the subsets of \(G\) and which has an edge \(\{X,Y\}\) if and only if \(G=\langle X\cup Y\rangle\). \end{itemize} The author shows that a good amount of information on \(G\) can be derived from this, such as the following: \begin{itemize} \item whether \(G\) is nilpotent, supersolvable or perfect respectively (Proposition 6(1--3)); \item whether \(G\) is solvable (Theorem 9); \item the number of non-Frattini factors, or of nonabelian factors, in a chief series of \(G\) (Theorem 10); \item the probabibilistic zeta function of \(G\) as introduced by \textit{N. Boston} [Prog. Math. 138, 155--162 (1996; Zbl 0853.11075)] and \textit{A. Mann} [Forum Math. 8, No. 4, 429--459 (1996; Zbl 0852.20019)] (Proposition 10) and, consequently (using the classification of finite simple groups), whether \(G\) is \(p\)-solvable for any given prime \(p\) (bottom of page 121). \end{itemize} The two cases of given information on \(G\) can be treated simultaneously, based on the fact that in either case, one can determine an ordered lattice \(\Lambda\) whose elements \(x\) are labeled by positive integers \(\ell(x)\) such that there exists an isomorphism \(f\) from \(\Lambda\) to the lattice, ordered by inclusion, of all subgroups of \(G\) that are intersections of maximal subgroups of \(G\), and such that this isomorphism satisfies \(|f(x)|=\ell(x)\) for all \(x\in\Lambda\) (see the text passages between Situation 1 and Situation 2, and between Lemma 1 and Definition 2).
- Graphs encoding the generating properties of a finite group
- scientific article; zbMATH DE number 991510
- scientific article; zbMATH DE number 3884299
- FINITE GROUPS WITH THE SAME JOIN GRAPH AS A FINITE NILPOTENT GROUP
- scientific article; zbMATH DE number 1918700
- On partial ordering of chief factors in solvable groups
- Combinatorial methods for determining subgroup structures of finite groups.
- On Thompson problem
- Classes of Finite Groups
- Finite Groups withp-Multiplicative Probabilistic Zeta Function
- Finite soluble groups
- scientific article; zbMATH DE number 903688 (Why is no real title available?)
- Positively finitely generated groups
- RECOGNIZING SOLUBLE GROUPS FROM THEIR PROBABILISTIC ZETA FUNCTIONS
- The coset poset and probabilistic zeta function of a finite group
- The probabilistic zeta function of finite simple groups.
- Über die \(\Phi\)-Untergruppe endlicher Gruppen
This page was built for publication: Recognizing a finite group from the generating properties of its subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2662171)
