Skew Young tableau

1 Basic definitions

A skew Young tableau is a filling of a skew Young diagram with entries that satisfy prescribed order conditions. It generalizes the more familiar Young tableau by allowing the underlying shape to be non-rectangular and obtained by removing a smaller partition shape from a larger one. Such tableaux are central objects in algebraic combinatorics because they encode both shape data and numerical patterns.

1.1 Young diagrams and partitions

A partition is a finite nonincreasing sequence of positive integers, usually written as \(\lambda = (\lambda_1, \lambda_2, \dots)\), where \(\lambda_1 \ge \lambda_2 \ge \cdots\). The parts are commonly represented by left-justified rows of boxes, with row \(i\) containing \(\lambda_i\) boxes. This box arrangement is called a Young diagram.

Young diagrams provide a visual language for partitions and support many combinatorial constructions. They are used to define tableaux, compare shapes, and describe symmetries in algebraic settings. Their row lengths and column heights determine the geometry of the diagram.

1.2 Skew shapes

A skew shape is obtained by taking one Young diagram and removing the boxes of a smaller Young diagram from its corner, provided the smaller shape fits inside the larger one. The remaining set of boxes often has a disconnected or irregular outline, which gives the shape its “skew” appearance.

Skew shapes preserve enough of the partition structure to support tableau theory while introducing greater flexibility. They appear naturally in formulas involving products of symmetric functions and in branching problems in representation theory.

1.2.1 Construction from two partitions

Given two partitions \(\lambda\) and \(\mu\) with \(\mu_i \le \lambda_i\) for every \(i\), the skew shape \(\lambda/\mu\) is defined by removing the boxes of \(\mu\) from the upper-left corner of \(\lambda\). The outer partition \(\lambda\) determines the full diagram, while the inner partition \(\mu\) specifies the removed region.

This construction produces a finite set of boxes that retains row and column ordering inherited from the ambient Young diagram. The pair \((\lambda,\mu)\) encodes the shape completely.

1.2.2 Notation for skew diagrams

The notation \(\lambda/\mu\) is standard for a skew diagram. It indicates that the skew shape is formed from the outer partition \(\lambda\) with the inner partition \(\mu\) removed. When the context is clear, the terms skew shape and skew diagram are often used interchangeably.

This notation is concise and widely used in combinatorics, particularly when expressing skew Schur functions and tableau families. It also makes it easy to compare shapes by inclusion of partitions.

1.3 Definition of a skew Young tableau

A skew Young tableau is a filling of the boxes of a skew Young diagram with numbers, typically positive integers, arranged according to specified monotonicity rules. The precise rules depend on the type of tableau under consideration.

The tableau structure combines geometry and arithmetic. The shape determines where entries may appear, while the filling rules determine which assignments are allowed.

1.3.1 Filling conditions

In the most common convention, entries weakly increase from left to right along each row and strictly increase from top to bottom down each column. These conditions define a semistandard skew Young tableau. If instead the entries are required to increase strictly in both rows and columns, one obtains a standard skew Young tableau.

The specific conditions ensure compatibility with many counting formulas and algebraic identities. Different variants are chosen according to the intended application.

1.3.2 Semistandard and standard variants

Semistandard skew Young tableaux allow repeated entries in rows but not in columns. They are especially important in the study of Schur functions and representation theory. Standard skew Young tableaux use each label exactly once, usually the integers \(1,2,\dots,n\), where \(n\) is the number of boxes.

These two variants serve different purposes. Semistandard tableaux are suited to weight enumerations, while standard tableaux are often linked to linear extensions, hook-length methods, and bijective combinatorics.

2 Types of skew Young tableaux

Skew Young tableaux come in several closely related forms. The classification usually depends on whether entries are distinct, repeated, or arranged by a reversed convention. Each type captures a different combinatorial viewpoint.

2.1 Standard skew Young tableaux

A standard skew Young tableau is a filling of a skew shape with the numbers \(1,2,\dots,n\), each used exactly once, such that entries increase strictly from left to right in rows and from top to bottom in columns. The number \(n\) equals the total number of boxes in the shape.

These tableaux are often counted in connection with permutation-like objects. They reflect the shape’s partial order and play a role in the combinatorics of symmetric group representations.

2.2 Semistandard skew Young tableaux

A semistandard skew Young tableau allows repeated entries, subject to weak row increase and strict column increase. The entries are typically positive integers, and the multiplicity of each value contributes to the tableau’s weight.

Semistandard tableaux form a rich family because they encode more refined data than standard tableaux. They are the combinatorial basis for many formulas in symmetric function theory.

2.2.1 Row and column strictness rules

The row condition requires that entries do not decrease as one moves rightward across a row. The column condition requires that entries increase as one moves downward in a column. Together, these conditions constrain the possible fillings enough to make the set of tableaux manageable but still highly varied.

These rules are sometimes stated in reverse order depending on convention, but the essential idea remains the same: one direction is weakly monotone, the other strictly monotone. The distinction between the two directions is crucial in enumerative formulas.

2.2.2 Weight of a tableau

The weight of a semistandard tableau records how many times each integer appears. If the entry \(i\) occurs \(m_i\) times, the weight is the sequence \((m_1,m_2,\dots)\). This data is often encoded by a monomial \(x_1^{m_1}x_2^{m_2}\cdots\).

Weights are central in generating functions and symmetric function expansions. They allow tableaux to be organized by content rather than only by shape.

2.3 Reverse and conjugate forms

Reverse tableaux use opposite conventions for the monotonicity conditions, such as decreasing entries along rows and columns, or a reversed reading order. Conjugate forms are obtained by transposing the underlying diagram, interchanging rows and columns.

These variants are useful when translating between different combinatorial conventions. They often appear in dual formulations of tableaux identities and in symmetry arguments.

3 Properties and combinatorial structure

The combinatorial behavior of a skew Young tableau depends on its shape, its entries, and the order in which those entries are read. Several standard constructions make it possible to compare tableaux and relate them to other objects.

3.1 Shape and size

The shape of a skew tableau is the skew diagram on which it is drawn. Its size is the number of boxes in the shape, equivalently the number of entries in the tableau. Both features are fixed once the ambient partitions are chosen.

Shape controls the geometry of the tableau, while size controls the total amount of data. Many formulas depend only on these two quantities and not on the particular filling.

3.2 Entries, rows, and columns

The entries of a skew tableau are arranged according to the shape’s row and column structure. Because the shape may have missing cells, some rows can begin farther to the right than others, and some columns may be shorter than in a straight shape. This irregularity affects how order conditions are checked.

Rows and columns still serve as the basic coordinate system for the tableau. Most combinatorial operations, such as reading words and sliding procedures, are defined relative to these directions.

3.3 Reading words

A reading word is a linear sequence extracted from a tableau by scanning its entries in a prescribed order. It converts the two-dimensional object into a word, making it easier to apply word-based combinatorial techniques.

Reading words are especially important in Littlewood–Richardson theory and in the study of rectification. Different reading orders produce different but related encodings.

3.3.1 Row reading word

The row reading word is usually obtained by reading rows in a fixed order, often from bottom to top, and within each row from left to right or from right to left depending on convention. The resulting word captures the tableau’s row structure in a single sequence.

This encoding is commonly used in lattice-word criteria and in algorithms that test whether a tableau satisfies a special combinatorial condition. It also helps connect tableaux to permutations and insertion processes.

3.3.2 Column reading word

The column reading word is formed by scanning the tableau column by column in a prescribed direction. One common convention reads columns from left to right and within each column from bottom to top.

Column words are useful in dual formulations and transposed settings. They often reflect the same information as row words but in a form adapted to column-based arguments.

3.4 Rectification and jeu de taquin

Rectification is the process of transforming a skew tableau into a straight-shape tableau through a sequence of local moves. The standard procedure associated with this process is called jeu de taquin.

This theory shows that skew tableaux can often be studied by converting them into ordinary tableaux without losing essential combinatorial information. The rectification outcome is a key invariant in many applications.

3.4.1 Sliding procedures

A sliding procedure moves entries into empty positions according to local rules that preserve the tableau conditions. At each step, a neighboring entry is shifted into a vacancy, and the vacancy moves through the diagram until it reaches an outer boundary.

These slides are the elementary moves of jeu de taquin. Their systematic use produces a new tableau with a simpler shape.

3.4.2 Rectified straight shapes

The result of rectification is a tableau of straight shape, meaning a non-skew Young diagram. The final shape may depend on the initial filling, but in many settings the rectified tableau has stable and meaningful properties.

Rectification often reveals hidden structure. It can transform a skew problem into a classical tableau problem where more tools are available.

4 Enumeration

Counting skew Young tableaux is a major topic in combinatorics. Enumeration depends on the type of tableau, the shape, and the filling rules. Exact formulas and generating techniques are available in many important cases.

4.1 Counting standard skew tableaux

The number of standard skew Young tableaux of a given shape is a fundamental enumerative quantity. Unlike the straight-shape case, no single simple formula applies in full generality, but many shapes admit effective counting methods.

These counts are tied to linear extensions of certain posets and to determinants arising from the shape’s geometry. They are also related to probabilistic and asymptotic questions in combinatorics.

4.2 Hook-length-related methods

For ordinary Young diagrams, the hook-length formula gives a closed product expression for the number of standard tableaux. For skew shapes, analogues and extensions exist, though they are typically more complicated and may involve determinants or summations.

Hook-length-based methods remain important because they suggest structural parallels between straight and skew shapes. They also guide the derivation of exact and approximate counting formulas.

4.3 Determinantal formulas

Many skew tableau counts can be expressed by determinants, especially through formulas derived from the theory of symmetric functions and nonintersecting lattice paths. These determinant expressions are powerful because they reduce counting problems to linear algebra.

Determinantal methods are especially effective for families of shapes with regular boundary behavior. They also connect tableau enumeration to classical results such as the Lindström–Gessel–Viennot lemma.

4.4 Generating functions

Generating functions organize tableau counts by size, weight, or shape. For semistandard skew tableaux, the natural generating object is the skew Schur function, which sums monomials over all tableaux of the given shape.

Generating functions provide a compact way to encode large families of combinatorial data. They are indispensable in algebraic manipulations, coefficient extraction, and identity proofs.

5 Littlewood–Richardson theory

Littlewood–Richardson theory describes how skew tableaux encode coefficients that appear in the multiplication of Schur functions. It is one of the central links between tableaux combinatorics and representation theory.

5.1 Littlewood–Richardson coefficients

Littlewood–Richardson coefficients are nonnegative integers that measure how often one Schur function appears in the product of two others. They also count certain skew tableaux satisfying a special condition.

These coefficients are central because they simultaneously encode combinatorial, algebraic, and representation-theoretic information. Their positivity and integrality are among their most striking features.

5.2 Littlewood–Richardson tableaux

A Littlewood–Richardson tableau is a semistandard skew tableau with an additional condition on its reading word. This extra requirement selects the tableaux that contribute to Littlewood–Richardson coefficients.

The definition is designed so that the tableaux are counted exactly by the coefficients appearing in Schur function multiplication. This makes them one of the most important special classes of skew tableaux.

5.2.1 Lattice word condition

The lattice word condition requires that, in every initial segment of the reading word, the number of \(i\)'s is at least the number of \((i+1)\)'s for each relevant \(i\). This condition filters the tableaux to those with the desired multiplicity properties.

It is a strong combinatorial constraint and can be checked directly from the reading word. The condition is one of the key mechanisms behind the Littlewood–Richardson rule.

5.2.2 Yamanouchi words

Yamanouchi words are words satisfying the same balance property as lattice words, often described in slightly different language. They occur in many combinatorial contexts where prefix conditions govern admissibility.

In tableau theory, Yamanouchi-type conditions identify the fillings that correspond to Littlewood–Richardson coefficients. The terminology reflects the word-based nature of the criterion.

5.3 The Littlewood–Richardson rule

The Littlewood–Richardson rule gives a combinatorial interpretation of the coefficients in the product of Schur functions. It states that these coefficients are counted by Littlewood–Richardson tableaux of a specified skew shape and content.

This rule is one of the foundational results connecting tableaux to symmetric function algebra. It transforms an abstract multiplication problem into a concrete counting problem.

5.3.1 Schur function multiplication

When two Schur functions are multiplied, the product expands as a sum of Schur functions with nonnegative integer coefficients. The Littlewood–Richardson rule describes these coefficients explicitly in terms of skew tableaux.

This expansion is structurally important because it reveals the internal combinatorics of the Schur basis. It also provides an efficient route to many identities in symmetric function theory.

5.3.2 Representation-theoretic interpretation

In representation theory, Littlewood–Richardson coefficients describe how tensor products decompose into irreducible components in settings governed by polynomial representations. Skew tableaux provide the combinatorial model for these multiplicities.

This interpretation gives tableau theory a bridge to algebraic structures such as modules and characters. It also explains why the coefficients are so pervasive in classical representation theory.

6 Symmetric function connections

Skew Young tableaux are tightly linked to symmetric functions, especially Schur functions. Their fillings produce monomials whose sums encode rich algebraic information.

6.1 Schur functions and skew Schur functions

A Schur function is a symmetric function associated with a partition shape. A skew Schur function is the analogous symmetric function associated with a skew shape. It is defined by summing monomials over semistandard skew tableaux of that shape.

Skew Schur functions extend the straight-shape theory while preserving much of its structure. They occupy a central place in algebraic combinatorics because they unify tableau enumeration and symmetric function identities.

6.2 Expansion into Schur basis

Skew Schur functions can be expanded as linear combinations of ordinary Schur functions. The coefficients in this expansion are the Littlewood–Richardson coefficients.

This basis expansion is important because ordinary Schur functions form a distinguished basis for the ring of symmetric functions. The expansion therefore translates skew data into the language of classical symmetric function theory.

6.3 Skew Schur function identities

Skew Schur functions satisfy many identities reflecting the combinatorics of tableaux, shape inclusion, and symmetry. These include relations under transposition, factorization in special cases, and identities derived from tableau operations.

Such formulas are useful for simplifying expressions and proving equivalences between different combinatorial constructions. They also support computational approaches to symmetric functions.

6.4 Pieri-type rules

Pieri-type rules describe multiplication by special symmetric functions corresponding to single rows or columns. In the skew setting, these rules give controlled ways to add boxes to a shape while preserving tableau conditions.

These rules are among the simplest and most useful multiplication formulas in symmetric function theory. They often serve as building blocks for more general identities.

7 Applications

Skew Young tableaux have applications across several areas of mathematics. Their combinatorial nature makes them adaptable, while their algebraic encoding makes them powerful in structural problems.

7.1 Representation theory of symmetric groups

In the representation theory of symmetric groups, tableaux provide models for irreducible modules and decomposition rules. Skew tableaux help describe induced and restricted representations through combinatorial multiplicities.

This connection makes tableau counting relevant to character theory and branching behavior. The shape of a tableau often reflects the partition indexing a representation.

7.2 Representations of general linear groups

For general linear groups, Schur functions and tableaux describe polynomial representations and their tensor products. Skew tableaux appear naturally in the decomposition of such representations and in the study of highest-weight structures.

Their role is especially prominent in the combinatorial formulas that compute multiplicities. They provide a concrete encoding of abstract representation-theoretic data.

7.3 Algebraic geometry and Schubert calculus

In algebraic geometry, tableau combinatorics enters through Schubert calculus and intersection problems on Grassmannians and related varieties. Skew tableaux and Littlewood–Richardson coefficients help compute intersection numbers and structure constants.

This application reflects the deep interplay between geometry and combinatorics. Tableau rules often give practical methods for evaluating geometric quantities.

7.4 Enumerative combinatorics

Skew Young tableaux are widely used in enumerative combinatorics to count configurations subject to order constraints. They connect to lattice paths, posets, plane partitions, and other counting models.

Their versatility makes them a standard tool for translating geometric shapes into algebraic or analytic enumeration problems. Many classical counting results can be recast in tableau language.

8 Related concepts

Skew Young tableaux belong to a broader family of combinatorial structures associated with partitions, orderings, and algebraic representations. Several related objects share similar techniques and motivations.

8.1 Ordinary Young tableaux

Ordinary Young tableaux are tableaux of straight shape, meaning they are filled on a partition diagram without removing an inner shape. They are the non-skew special case and provide the foundational example for tableau theory.

Many results for skew tableaux generalize or refine corresponding statements for ordinary tableaux. Straight shapes are often simpler to analyze, making them a natural reference point.

8.2 Plane partitions

Plane partitions are two-dimensional arrays of integers with monotonicity conditions in two directions. They are related to tableau theory through generating functions, lattice models, and certain bijective correspondences.

Although their geometry differs from that of Young tableaux, plane partitions share a similar combinatorial flavor. Both structures organize integer data into ordered arrays.

8.3 Gelfand–Tsetlin patterns

Gelfand–Tsetlin patterns are triangular arrays of integers satisfying interlacing conditions. They encode representation-theoretic information and are closely related to semistandard tableaux.

These patterns provide an alternative model for the same algebraic phenomena that tableaux describe. They are often used in counting and in the study of branching rules.

8.4 Crystal bases

Crystal bases are combinatorial models arising in the representation theory of quantum groups. Their elements and operators can often be described using tableaux-like objects, including semistandard and skew tableaux.

The connection highlights the modern algebraic role of tableau combinatorics. In this setting, tableaux serve as discrete shadows of deeper algebraic structures.