Symmetric group | EPFL Graph Search

Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

In abstract algebra, the symmetric group defined over any set is the group whose elements are all the bijections from the set to itself, and whose group operation is the composition of functions. In particular, the finite symmetric group defined over a finite set of symbols consists of the permutations that can be performed on the symbols. Since there are ( factorial) such permutation operations, the order (number of elements) of the symmetric group is . Although symmetric groups can be defined on infinite sets, this article focuses on the finite symmetric groups: their applications, their elements, their conjugacy classes, a finite presentation, their subgroups, their automorphism groups, and their representation theory. For the remainder of this article, "symmetric group" will mean a symmetric group on a finite set. The symmetric group is important to diverse areas of mathematics such as Galois theory, invariant theory, the representation theory of Lie groups, and combinatorics. Cayley's theorem states that every group is isomorphic to a subgroup of the symmetric group on (the underlying set of) . The symmetric group on a finite set is the group whose elements are all bijective functions from to and whose group operation is that of function composition. For finite sets, "permutations" and "bijective functions" refer to the same operation, namely rearrangement. The symmetric group of degree is the symmetric group on the set . The symmetric group on a set is denoted in various ways, including , , , , and . If is the set then the name may be abbreviated to , , , or . Symmetric groups on infinite sets behave quite differently from symmetric groups on finite sets, and are discussed in , , and . The symmetric group on a set of elements has order (the factorial of ). It is abelian if and only if is less than or equal to 2. For and (the empty set and the singleton set), the symmetric groups are trivial (they have order ). The group Sn is solvable if and only if .

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.

Related publications (14)

Related people (1)

Donna Testerman

Related concepts (145)

Related courses (32)

Related lectures (265)

Related MOOCs (10)

In this thesis, we investigate the inverse problem of trees and barcodes from a combinatorial, geometric, probabilistic and statistical point of view.Computing the persistent homology of a merge tree

EPFL2022

From Trees to Barcodes and Back Again: Theoretical and Statistical Perspectives

Kathryn Hess Bellwald, Lida Kanari, Adélie Eliane Garin

Methods of topological data analysis have been successfully applied in a wide range of fields to provide useful summaries of the structure of complex data sets in terms of topological descriptors, su

2020

Maximal subgroups acting with two composition factors on irreducible representations of exceptional algebraic groups

Nathan Scheinmann

Let

Y

be a simply connected simple algebraic group over an algebraically closed field

k

of characteristic

p

and let

X

be a maximal closed connected simple subgroup of

Y

. Excluding some smal

EPFL2019

Center (group theory)

In abstract algebra, the center of a group, G, is the set of elements that commute with every element of G. It is denoted Z(G), from German Zentrum, meaning center. In set-builder notation, Z(G) = . The center is a normal subgroup, Z(G) ⊲ G. As a subgroup, it is always characteristic, but is not necessarily fully characteristic. The quotient group, G / Z(G), is isomorphic to the inner automorphism group, Inn(G). A group G is abelian if and only if Z(G) = G. At the other extreme, a group is said to be centerless if Z(G) is trivial; i.

Commutator subgroup

In mathematics, more specifically in abstract algebra, the commutator subgroup or derived subgroup of a group is the subgroup generated by all the commutators of the group. The commutator subgroup is important because it is the smallest normal subgroup such that the quotient group of the original group by this subgroup is abelian. In other words, is abelian if and only if contains the commutator subgroup of . So in some sense it provides a measure of how far the group is from being abelian; the larger the commutator subgroup is, the "less abelian" the group is.

Symmetric group

MATH-506: Topology IV.b - cohomology rings

Singular cohomology is defined by dualizing the singular chain complex for spaces. We will study its basic properties, see how it acquires a multiplicative structure and becomes a graded commutative a

MATH-486: Statistical mechanics and Gibbs measures

This course provides a rigorous introduction to the ideas, methods and results of classical statistical mechanics, with an emphasis on presenting the central tools for the probabilistic description of

MATH-113: Algebraic structures

Le but de ce cours est d'introduire et d'étudier les notions de base de l'algèbre abstraite.

Automorphism groups of trees and graphs

Explores automorphisms of graphs, focusing on automorphism groups, Cayley-Abels graphs, and quasi-isometry.

Automorphism Groups: Trees and Graphs III

Explores automorphism groups of trees and graphs, including actions on trees and group homomorphisms.

Automorphism groups of trees and graphs II

Explores the uniqueness of trees, automorphism groups, Cayley-Abels graphs, and constructing vertex-transitive subgroups with prescribed local actions.

Algebra (part 1)

Un MOOC francophone d'algèbre linéaire accessible à tous, enseigné de manière rigoureuse et ne nécessitant aucun prérequis.

Algebra (part 1)

Un MOOC francophone d'algèbre linéaire accessible à tous, enseigné de manière rigoureuse et ne nécessitant aucun prérequis.

Algebra (part 2)

Un MOOC francophone d'algèbre linéaire accessible à tous, enseigné de manière rigoureuse et ne nécessitant aucun prérequis.