Recognizing Simple Groups by Their Codegree Sets
An arithmetic property of a group G is a property that can be expressed solely in terms of numbers. The restrictions that certain arithmetic properties place on the structure of a group is a well-studied and fruitful area of research; two of the most well-known theorems pertaining to arithmetic properties assert that all groups of order 2 are abelian and that all finite groups of odd order are solvable. While both of these theorems arise from a single arithmetic property, namely the order of a group, strong conjectures have been made concerning sets of arithmetic properties. For example, in 2000, Huppert conjectured that if a finite nonabelian simple group H and a finite group G share the same character degree set, then G ∼= H × A for some abelian group A. More recently, a stronger conjecture, often called the codegree version of Huppert’s conjecture, has been posed as question 20.79 in the Kourovka Notebook: if H is a nonabelian simple group and G is a finite group such that H and G have equal codegree sets, then G ∼= H. In other words, nonabelian simple groups are recognizable by their codegree sets. Huppert’s codegree conjecture has been verified for several simple groups, but it has yet to be completely proved. In this paper, we verify this conjecture for the sporadic groups and the simple alternating groups.
U.S. copyright laws protect this material. Commercial use or distribution of this material is not permitted without prior written permission of the copyright holder.