Concept

Symmetric group

Related concepts (51)

Graph Chatbot

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.

Maschke's theorem

In mathematics, Maschke's theorem, named after Heinrich Maschke, is a theorem in group representation theory that concerns the decomposition of representations of a finite group into irreducible pieces. Maschke's theorem allows one to make general conclusions about representations of a finite group G without actually computing them. It reduces the task of classifying all representations to a more manageable task of classifying irreducible representations, since when the theorem applies, any representation is a direct sum of irreducible pieces (constituents).

Up to

Two mathematical objects a and b are called equal up to an equivalence relation R if a and b are related by R, that is, if aRb holds, that is, if the equivalence classes of a and b with respect to R are equal. This figure of speech is mostly used in connection with expressions derived from equality, such as uniqueness or count. For example, x is unique up to R means that all objects x under consideration are in the same equivalence class with respect to the relation R.

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.

Complete group

In mathematics, a group G is said to be complete if every automorphism of G is inner, and it is centerless; that is, it has a trivial outer automorphism group and trivial center. Equivalently, a group is complete if the conjugation map, G → Aut(G) (sending an element g to conjugation by g), is an isomorphism: injectivity implies that only conjugation by the identity element is the identity automorphism, meaning the group is centerless, while surjectivity implies it has no outer automorphisms.

Cycle graph (algebra)

In group theory, a subfield of abstract algebra, a group cycle graph illustrates the various cycles of a group and is particularly useful in visualizing the structure of small finite groups. A cycle is the set of powers of a given group element a, where an, the n-th power of an element a is defined as the product of a multiplied by itself n times. The element a is said to generate the cycle. In a finite group, some non-zero power of a must be the group identity, e; the lowest such power is the order of the cycle, the number of distinct elements in it.

Length function

In the mathematical field of geometric group theory, a length function is a function that assigns a number to each element of a group. A length function L : G → R+ on a group G is a function satisfying: Compare with the axioms for a metric and a filtered algebra. Word metric An important example of a length is the word metric: given a presentation of a group by generators and relations, the length of an element is the length of the shortest word expressing it.

Automorphisms of the symmetric and alternating groups

In group theory, a branch of mathematics, the automorphisms and outer automorphisms of the symmetric groups and alternating groups are both standard examples of these automorphisms, and objects of study in their own right, particularly the exceptional outer automorphism of S6, the symmetric group on 6 elements. , and thus . Formally, is complete and the natural map is an isomorphism. , and the outer automorphism is conjugation by an odd permutation. Indeed, the natural maps are isomorphisms.

Young symmetrizer

In mathematics, a Young symmetrizer is an element of the group algebra of the symmetric group, constructed in such a way that, for the homomorphism from the group algebra to the endomorphisms of a vector space obtained from the action of on by permutation of indices, the image of the endomorphism determined by that element corresponds to an irreducible representation of the symmetric group over the complex numbers. A similar construction works over any field, and the resulting representations are called Specht modules.

Frobenius group

In mathematics, a Frobenius group is a transitive permutation group on a finite set, such that no non-trivial element fixes more than one point and some non-trivial element fixes a point. They are named after F. G. Frobenius. Suppose G is a Frobenius group consisting of permutations of a set X. A subgroup H of G fixing a point of X is called a Frobenius complement. The identity element together with all elements not in any conjugate of H form a normal subgroup called the Frobenius kernel K.

Reflection group

In group theory and geometry, a reflection group is a discrete group which is generated by a set of reflections of a finite-dimensional Euclidean space. The symmetry group of a regular polytope or of a tiling of the Euclidean space by congruent copies of a regular polytope is necessarily a reflection group. Reflection groups also include Weyl groups and crystallographic Coxeter groups. While the orthogonal group is generated by reflections (by the Cartan–Dieudonné theorem), it is a continuous group (indeed, Lie group), not a discrete group, and is generally considered separately.