MathieuGroupM11

MathieuGroupM11[]

represents the sporadic simple Mathieu group .

Details

  • By default, MathieuGroupM11[] is represented as a permutation group acting on points {1,…,11}.

Background & Context

  • MathieuGroupM11[] represents the Mathieu group , which is a group of order . It is one of the 26 sporadic simple groups of finite order. The default representation of MathieuGroupM11 is as a permutation group on the symbols having generators Cycles[{{2,10},{4,11},{5,7},{8,9}}] and Cycles[{{1,4,3,8},{2,5,6,9}}].
  • The Mathieu group is the smallest of the sporadic finite simple groups. It was discovered (along with the other four Mathieu groups MathieuGroupM12, MathieuGroupM22, MathieuGroupM23 and MathieuGroupM24) by mathematician Émile Léonard Mathieu in the late 1800s, making these groups tied for first in chronological order of discovery among sporadic groups. MathieuGroupM11 is one of a very small number of groups to be sharply 4-transitive in the sense that there exists a unique group element mapping any unique 4-tuple of elements of MathieuGroupM11 to any other unique 4-tuple therein. In addition to its permutation representation, can be defined in terms of generators and relations as . It is the stabilizer of a point in . Along with the other sporadic simple groups, the Mathieu groups played a foundational role in the monumental (and complete) classification of finite simple groups.
  • The usual group theoretic functions may be applied to MathieuGroupM11[], including GroupOrder, GroupGenerators, GroupElements and so on. A number of precomputed properties of the Mathieu group are available via FiniteGroupData[{"Mathieu",11},"prop"].
  • MathieuGroupM11 is related to a number of other symbols. Along with MathieuGroupM12, MathieuGroupM22, MathieuGroupM23 and MathieuGroupM24, MathieuGroupM11 is one of five groups collectively referred to as the so-called "first generation" of sporadic finite simple groups. It is also one of 20 so-called "happy" sporadic groups, which all appear as a subquotient of the monster group.

Examples

open allclose all

Basic Examples  (1)

Order of the group :

Generators of a permutation representation of the group :

Properties & Relations  (2)

The default permutation representation on 11 points is 4-transitive. The list {1,2,3,4} can be mapped to any other list of four integers in Range[11]:

Separate group elements in different conjugacy classes:

These are the possible cyclic structures:

Corresponding orders (maximum is 11):

Number of elements in each class:

All together:

Wolfram Research (2010), MathieuGroupM11, Wolfram Language function, https://reference.wolfram.com/language/ref/MathieuGroupM11.html.

Text

Wolfram Research (2010), MathieuGroupM11, Wolfram Language function, https://reference.wolfram.com/language/ref/MathieuGroupM11.html.

CMS

Wolfram Language. 2010. "MathieuGroupM11." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/MathieuGroupM11.html.

APA

Wolfram Language. (2010). MathieuGroupM11. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/MathieuGroupM11.html

BibTeX

@misc{reference.wolfram_2024_mathieugroupm11, author="Wolfram Research", title="{MathieuGroupM11}", year="2010", howpublished="\url{https://reference.wolfram.com/language/ref/MathieuGroupM11.html}", note=[Accessed: 21-November-2024 ]}

BibLaTeX

@online{reference.wolfram_2024_mathieugroupm11, organization={Wolfram Research}, title={MathieuGroupM11}, year={2010}, url={https://reference.wolfram.com/language/ref/MathieuGroupM11.html}, note=[Accessed: 21-November-2024 ]}