Concept

Quasithin group

In mathematics, a quasithin group is a finite simple group that resembles a group of Lie type of rank at most 2 over a field of characteristic 2. More precisely it is a finite simple group of characteristic 2 type and width 2. Here characteristic 2 type means that its centralizers of involutions resemble those of groups of Lie type over fields of characteristic 2, and the width is roughly the maximal rank of an abelian group of odd order normalizing a non-trivial 2-subgroup of G. When G is a group of Lie type of characteristic 2 type, the width is usually the rank (the dimension of a maximal torus of the algebraic group). The classification of quasithin groups is a crucial part of the classification of finite simple groups. The quasithin groups were classified in a 1221-page paper by . An earlier announcement by of the classification, on the basis of which the classification of finite simple groups was announced as finished in 1983, was premature as the unpublished manuscript of his work was incomplete and contained serious gaps. According to , the finite simple quasithin groups of even characteristic are given by Groups of Lie type of characteristic 2 and rank 1 or 2, except that U5(q) only occurs for q = 4 PSL4(2), PSL5(2), Sp6(2) The alternating groups on 5, 6, 8, 9, points PSL2(p) for p a Fermat or Mersenne prime, L(3), L(3), G2(3) The Mathieu groups M11, M12, M22, M23, M24, The Janko groups J2, J3, J4, the Higman-Sims group, the Held group, and the Rudvalis group. If the condition "even characteristic" is relaxed to "even type" in the sense of the revision of the classification by Daniel Gorenstein, Richard Lyons, and Ronald Solomon, then the only extra group that appears is the Janko group J1.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.