SOLVABILITY OF GROUPS OF ODD ORDER

By W. Feit, J. Thompson. 2012

375 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

On the number of classes of conjugate Hall subgroups in finite simple groups (2010, methodology): “Together with the famous Odd Order Theorem (see [6]) this result implies the classification of Hall subgroups of odd order in alternating groups.”
Nonsoluble and non-p-soluble length of finite groups (2013, methodology): “Using the Feit–Thompson theorem [5] it is easy to see that H is a soluble subgroup of G.”
A Machine-Checked Proof of the Odd Order Theorem (2013, background): “A group G consists of a set, usually also named G, together with an associative binary law ∗, usually denoted by juxtaposition, and an identity element 1, such that each element g of G has an inverse g−1, satisfying gg−1 = g−1g = 1.”
Group Theory (2019, background): “The proof is 255 pages long and occupies an entire volume of the Pacific Journal of Mathematics [6].”