Thompson's conjecture for some finite simple groups with connected prime graph.
DOI10.1007/S10469-013-9206-0zbMATH Open1309.20019OpenAlexW2094090342WikidataQ123262300 ScholiaQ123262300MaRDI QIDQ354472FDOQ354472
Publication date: 19 July 2013
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-013-9206-0
Recommendations
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Simple groups: alternating groups and groups of Lie type (20D06) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Conjugacy classes for groups (20E45)
Cites Work
- Prime graph components of finite groups
- A Diophantine equation which arises in the theory of finite groups
- An Adjacency Criterion for the Prime Graph of a Finite Simple Group
- On recognition by spectrum of finite simple linear groups over fields of characteristic 2.
- On Large Zsigmondy Primes
- Title not available (Why is that?)
- On connection between the structure of a finite group and the properties of its prime graph.
- Nilpotent groups and their automorphisms
- Title not available (Why is that?)
- Groups with the same non-commuting graph.
- Title not available (Why is that?)
- A new characterization of finite simple groups
- Title not available (Why is that?)
- On Thompson's conjecture
- On Thompson's conjecture.
- Recognition of the simple groups L3(q) by element orders
- Further reflections on Thompson's conjecture
- Notes on the length of conjugacy classes of finite groups.
- Title not available (Why is that?)
- On the Orders of Maximal Subgroups of the Finite Classical Groups
- A characterization ofL n (q) by the normalizers' orders of their sylow subgroups
- \(r\)-recognizability of \(B_n(q)\) and \(C_n(q)\) where \(n=2^m\geqslant 4\).
- On Finite Groups with Given Conjugate Types I
- A characterization of the finite simple groups
- On Thompson's conjecture for some finite simple groups.
Cited In (10)
- Thompson's conjecture for finite simple groups of Lie type \(B_n\) and \(C_n\).
- Finite groups with the same conjugacy class sizes as a finite simple group
- Thompson's group \(F\) is 1-counter graph automatic.
- The Thompson chain of subgroups of the Conway group \(\mathrm{Co}_1\) and complete graphs on \(n\) vertices
- Non-solvable groups and the two-prime hypothesis on conjugacy class sizes
- PGL2(q) cannot be determined by its cs
- On Thompson’s conjecture for finite simple groups
- Characterization of \(\text{PGL}(2,p)\) by its order and one conjugacy class size.
- On Thompson's conjecture for some finite simple groups.
- Thompson’s conjecture on conjugacy class sizes for the simple group PSUn(q)
This page was built for publication: Thompson's conjecture for some finite simple groups with connected prime graph.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354472)