Recognition by element orders for simple linear and unitary groups
Abstract
For a finite group G, let ω(G) be the set of element orders of G and let h(G) be the number of pairwise nonisomorphic finite groups H with ω(H)=ω(G). We say that the recognition problem is solved for G if the number h(G) is known, and if h(G) is finite, then all finite groups H with ω(H)=ω(G) are described. We complete the solution of the recognition problem for the finite simple linear and unitary groups.
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.