On Thompson's conjecture for alternating and symmetric groups

preprint2015arXivOpen access

Abstract

For a finite group GG denote by N(G)N(G) the set of conjugesy class sizes of GG. We show that every finite group GG with the property N(G)=N(Altn),n>4N(G)=N(Alt_n), n>4 or N(G)=N(Symn),n>22N(G)=N(Sym_n), n>22 is non-solvable.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.