Abstract
AbstractLet k be a divisor of a finite group G and Lk(G) = {x ∈ G | xk =1}. Frobenius proved that the number |Lk(G)| is always divisible by k. The following inverse problem is considered: for a given integer n, find all groups G such that max{k-1|Lk(G)| | k ∈ Div(G)} = n, where Div(G) denotes the set of all divisors of |G|. A procedure beginning with (in a sense) minimal members and deducing the remaining ones is outlined and executed for n=8.
Publisher
Cambridge University Press (CUP)
Reference12 articles.
1. Random generation of finite and profinite groups and group enumeration
2. 3. Frobenius, G. , Verallgemeinerung des Sylowschen Satzen, Berliner Sitz. (1895), 981–993.
3. ON AN INVERSE PROBLEM TO FROBENIUS' THEOREM II
4. Endliche Gruppen I
5. 4. Frobenius, G. , Über einen Fundamentalsatz der Gruppentheorie, Berliner Sitz. (1903), 987–991.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献