Pariah group

From testwiki
Jump to navigation Jump to search

Template:Short description

Relationships among the sporadic simple groups. The monster group M is at the top, and the groups which are descended from it are the happy family.
The six which are not connected by an upward path to M (white ellipses) are the pariahs.

In group theory, the term pariah was introduced by Robert Griess in Template:Harvtxt to refer to the six sporadic simple groups which are not subquotients of the monster group.

The twenty groups which are subquotients, including the monster group itself, he dubbed the happy family.

For example, the orders of J4 and the Lyons Group Ly are divisible by 37. Since 37 does not divide the order of the monster, these cannot be subquotients of it; thus J4 and Ly are pariahs. Three other sporadic groups were also shown to be pariahs by Griess in 1982, and the Janko Group J1 was shown to be the final pariah by Robert A. Wilson in 1986.

The pariah groups

List of pariah groups
Group Size Template:Abbr
size
Factorized order First
missing
prime in order
Lyons group, Ly Template:Val 5Template:E 28 · 37 · 56 · 7 · 11 · 31 · 37 · 67 13
O'Nan group, O'N Template:Val 5Template:E 29 · 34 · 5 · 73 · 11 · 19 · 31 13
Rudvalis group, Ru Template:Val 1Template:E 214 · 33 · 53 · 7 · 13 · 29 11
Janko group, J4 Template:Val 9Template:E 221 · 33 · 5 · 7 · 113 · 23 · 29 · 31 · 37 · 43 13
Janko group, J3 Template:Val 5Template:E 27 · 35 · 5 · 17 · 19 7
Janko group, J1 Template:Val 2Template:E 23 · 3 · 5 · 7 · 11 · 19 13

Lyons group

Template:Main article The Lyons group, Ly, is the unique group (up to isomorphism) that has in involution t where CG(t) is the covering group of the alternating group A11, and t is not weakly closed in CG(t). Richard Lyons, the namesake of these groups, was the first to consider their properties, including their order, and Charles Sims proved with machine calculation that such a group must exist and be unique. The group has an order of 28⋅37⋅56⋅7⋅11⋅31⋅37⋅67.[1]

O'Nan group

Template:Excerpt

Rudvalis group

Template:Main article The Rudvalis group is a finite simple group R that is a rank 3 permutation group on 4060 letters where the stabilizer of a point is the Ree group. The group was described by Arunas Rudvalis, who proved the existence of such a group. This group has order of 145,926,144,000=214⋅33⋅53⋅7⋅13⋅29.[2]

Janko groups

J4

Template:Excerpt

J3

Template:Excerpt

J1

Template:Excerpt

References

Template:Reflist


Template:Group-theory-stub