Young tableau

In mathematics, a Young tableau (tæˈbloʊ,_ˈtæbloʊ; plural: tableaux) is a combinatorial object useful in representation theory and Schubert calculus. It provides a convenient way to describe the group representations of the symmetric and general linear groups and to study their properties. Young tableaux were introduced by Alfred Young, a mathematician at Cambridge University, in 1900. They were then applied to the study of the symmetric group by Georg Frobenius in 1903. Their theory was further developed by many mathematicians, including Percy MacMahon, W. V. D. Hodge, G. de B. Robinson, Gian-Carlo Rota, Alain Lascoux, Marcel-Paul Schützenberger and Richard P. Stanley. Note: this article uses the English convention for displaying Young diagrams and tableaux. A Young diagram (also called a Ferrers diagram, particularly when represented using dots) is a finite collection of boxes, or cells, arranged in left-justified rows, with the row lengths in non-increasing order. Listing the number of boxes in each row gives a partition λ of a non-negative integer n, the total number of boxes of the diagram. The Young diagram is said to be of shape λ, and it carries the same information as that partition. Containment of one Young diagram in another defines a partial ordering on the set of all partitions, which is in fact a lattice structure, known as Young's lattice. Listing the number of boxes of a Young diagram in each column gives another partition, the conjugate or transpose partition of λ; one obtains a Young diagram of that shape by reflecting the original diagram along its main diagonal. There is almost universal agreement that in labeling boxes of Young diagrams by pairs of integers, the first index selects the row of the diagram, and the second index selects the box within the row. Nevertheless, two distinct conventions exist to display these diagrams, and consequently tableaux: the first places each row below the previous one, the second stacks each row on top of the previous one.

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 (10)

Related people (2)

Related concepts (14)

Related courses (1)

Related lectures (2)

Asymptotic freedom, Haldane gap and edge states of SU(N) spin chains

Samuel Gozel

In this thesis we study various one-dimensional quantum spin systems with SU(2) and SU(N) symmetry. We investigate the short-distance behavior of the SU(2) Heisenberg model in the limit of large spin

EPFL2020

Haldane Gap of the Three-Box Symmetric SU(3) Chain

Frédéric Mila, Pierre Marcel Nataf, Samuel Gozel

Motivated by the recent generalization of the Haldane conjecture to SU(3) chains [Lajko et al., Nucl. Phys. B924, 508 (2017)] according to which a Haldane gap should be present for symmetric represent

AMER PHYSICAL SOC2020

, ,

It was recently argued that SU(3) chains in the p-box symmetric irreducible representation (irrep) exhibit a "Haldane gap" when p is a multiple of 3 and are otherwise gapless [Nucl. Phys. B 924, 508 (

AMER PHYSICAL SOC2019

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.

Young tableau

Representation theory of finite groups

The representation theory of groups is a part of mathematics which examines how groups act on given structures. Here the focus is in particular on operations of groups on vector spaces. Nevertheless, groups acting on other groups or on sets are also considered. For more details, please refer to the section on permutation representations. Other than a few marked exceptions, only finite groups will be considered in this article. We will also restrict ourselves to vector spaces over fields of characteristic zero.

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

Machine Learning at the Atomic Scale PHYS-754: Lecture series on scientific machine learning

Explores simple models, electronic structure evaluation, and machine learning at the atomic scale.

Properties of Finite Dimensional Algebras MATH-334: Representation theory

Covers the properties of finite dimensional algebras and non-semisimple representations.