On a theorem of Frobenius.
Let \( G \) be a finite group of order \( |G|, n \) a divisor of \( |G| \). Frobenius proved that the number of elements satisfying the equation \( x^{n}=1 \) is a multiple of \( n \). He conjectured that \( I=\left\{x \in G \mid x^{n}=1\right\} \) is a subgroup of \( G \), if \( |I|=n \). This conjecture is proved in the case \( (n,|G| / n) \neq 1 \). The proof is based on the fact that the p-Sylow subgroups which belong to a prime dividing \( (n,|G| / n) \) are cyclic. This follows by an application of an ``Anzahl-theorem of \textit{P. Hall} [Proc. Lond. Math. Soc. (2) 40, 468--480 (1936; Zbl 0015.20201)]. Thereby a connection between the case for \( G \) and the case for the normaliser of a maximal p-subgroup in \( L \) can be established, where \( p \) is the minimal prime dividing \( (n,|G| / n) \). An induction argument leads to the result.
- A conjecture of Frobenius and the simple groups of Lie type. II
- A conjecture of frobenius and the sporadic simple groups
- Finite groups
- On a problem of Frobenius
- On a bijection between a finite group to a non-cyclic group with divisibility of element orders
- A conjecture of Frobenius and the simple groups of Lie type. I
This page was built for publication: On a theorem of Frobenius.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4173556)