# SymmetricGroup

represents the symmetric group of degree n.

# Details

• The degree n of must be a non-negative integer. Degrees 0 and 1 correspond to the trivial or identity group.
• is represented by default as a permutation group on the points {1,,n}.

# Background & Context

• represents the symmetric group (sometimes denoted ) on n symbols for a given non-negative integer n. For , the default representation of is as a permutation group on the symbols . The special cases and are equivalent to the trivial group with exactly one element.
• Mathematically, the symmetric group (for ) consists of the permutations of the symbols together with the group operation of composition. Symmetric groups are therefore permutation groups of order with the elements of coinciding with Permutations[Range[n]].
• Symmetric groups are of fundamental importance in abstract algebra, geometric group theory, representation theory, combinatorics and mathematical physics. A number of important mathematical results hold for symmetric groups. For example, Cayley's theorem states that every abstract group is isomorphic to some subgroup of the symmetric group .
• The usual group theoretic functions may be applied to , including GroupOrder, GroupGenerators, GroupElements and so on. A number of precomputed properties of the symmetric group are available via FiniteGroupData[{"SymmetricGroup",n},"prop"].
• SymmetricGroup is related to a number of other symbols. Both alternating groups and dihedral groups are important subgroups of symmetric groups. Other infinite families of finite groups built into the Wolfram Language that are parametrized by integers include AbelianGroup, AlternatingGroup, CyclicGroup and DihedralGroup

# Examples

open allclose all

## Basic Examples(3)

Number of elements of a symmetric group:

 In[1]:=
 Out[1]=

Permutation generators of a symmetric group:

 In[1]:=
 Out[1]=

Elements of a permutation representation of a symmetric group:

 In[1]:=
 Out[1]=