Symmetric Group

Also found in: Dictionary, Wikipedia.

symmetric group

[sə′me·trik ′grüp]
The group consisting of all permutations of a finite set of symbols.

Symmetric Group


A symmetric group of order n is a group consisting of all possible permutations of n objects. Such a group has n! elements. The permutations of n objects with an even number of inversions form an alternating subgroup of the symmetric group; this alternating subgroup has n!/2 elements.

Mentioned in ?
References in periodicals archive ?
Our interest in this result stems from the crucial role it plays in Quillen's method [8] for proving homological stability of the symmetric groups.
1 INTRODUCTION: The symmetric group Sn is defined over the regular figure n-gon with order n
Rule 2: For any arriving HC request, SHM must first search the wavelengths of the symmetric group to find one to construct the HC.
Although we are only concerned with the symmetric group, we give the full definition here.
It is a natural extension of (3) from the viewpoint of absolute mathematics, because the symmetric group is interpreted as [S.
The group of all permutations of X under composition of mappings is called the symmetric group on X and is denoted by [S.
Survey articles describe current efforts to classify endotrivial modules over the group algebras of finite groups, recent developments in the theory of affine q-Schur algebras, and Frobenius twists in the representation theory of the symmetric group.
It is well known (see for instance Goulden and Jackson [17]) that the study of cacti is closely related to the enumeration of factorizations of particular permutations of the symmetric group.
i) Here is the symmetric group analogue of this conjecture:
Shareshian, On the Mobius number of the subgroup lattice of the symmetric group, J.
Kanovei begins with an explanation of the descriptive said he read it back ground, and some theorems of descriptive set theory, then progresses to such topics as Borel ideals, equivalence relations, Borel reducibility of equivalents relations, elementary results, countable equivalence relations, hyperfinite equivalence relations, the first and second dichotomy theorems actions of the infinite symmetric group, turbulent group actions, summable equivalence relations, equalities, pinned equivalence relations, and the production of Borel equivalence relations to Borel ideals.
The topics include the sum of squares basis pursuit with linear and second order cone programming, representation theory of the symmetric group in voting theory and game theory, geometric combinatorics and computational molecular biology: branching polytopes for RNA sequences, the neural network coding of natural images with applications to pure mathematics, proving Tucker's Lemma with a volume argument, and a survey of discrete methods in (algebraic) statistics for networks.

Full browser ?