Lecture

Permutations and Symmetric Groups

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture covers the concepts of symmetric groups, transpositions, sign of a permutation, alternating groups, and conjugacy classes in symmetric groups. It explains how any permutation can be uniquely written as a product of disjoint cycles and how disjoint cycles commute. The lecture also discusses the theorem that a product of an odd number of transpositions cannot be equal to a product of an even number of transpositions. Furthermore, it explores the idea of inversion in permutations and the action of transpositions on the number of inversions. The lecture concludes with the concept of conjugacy classes and their relation to cycle types in symmetric groups.

Official source

Ontological neighbourhood

Mathematics

Algebra: Representation theory

Related concepts (23)

Representation theory of the symmetric group

In mathematics, the representation theory of the symmetric group is a particular case of the representation theory of finite groups, for which a concrete and detailed theory can be obtained. This has a large area of potential applications, from symmetric function theory to quantum chemistry studies of atoms, molecules and solids. The symmetric group Sn has order n!. Its conjugacy classes are labeled by partitions of n.

Cyclic permutation

In mathematics, and in particular in group theory, a cyclic permutation is a permutation consisting of a single cycle. In some cases, cyclic permutations are referred to as cycles; if a cyclic permutation has k elements, it may be called a k-cycle. Some authors widen this definition to include permutations with fixed points in addition to at most one non-trivial cycle. In cycle notation, cyclic permutations are denoted by the list of their elements enclosed with parentheses, in the order to which they are permuted.

Alternating group

In mathematics, an alternating group is the group of even permutations of a finite set. The alternating group on a set of n elements is called the alternating group of degree n, or the alternating group on n letters and denoted by A_n or Alt(n). For n > 1, the group An is the commutator subgroup of the symmetric group Sn with index 2 and has therefore n!/2 elements. It is the kernel of the signature group homomorphism sgn : Sn → explained under symmetric group. The group An is abelian if and only if n ≤ 3 and simple if and only if n = 3 or n ≥ 5.

Symmetric group

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 .

Permutation

In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or process of changing the linear order of an ordered set. Permutations differ from combinations, which are selections of some members of a set regardless of order. For example, written as tuples, there are six permutations of the set {1, 2, 3}, namely (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), and (3, 2, 1).

Related lectures (53)

Symmetric Group and Group Actions

Covers the Symmetric group, cycle decomposition, transpositions, even and odd permutations, and group actions.

Group Theory Basics

Covers the fundamental concepts of group theory and examples of real numbers and permutations.

Symmetric Group and Alternating Group

Explores the Symmetric group, cycle notation, multiplication, the sign of a permutation, and the Alternating group.

Differentiable Ranking and Sorting

Explores differentiable ranking and sorting techniques for machine learning applications.

Group Theory: Definition and Examples