On Thompson's conjecture for alternating and symmetric groups
Abstract
For a finite group G denote by N(G) the set of conjugesy class sizes of G. We show that every finite group G with the property N(G)=N(Altn), n>4 or N(G)=N(Symn), n>22 is non-solvable.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.