Cells and constructible representations in type .

Pietraho, Thomas

Displaying similar documents to “Cells and constructible representations in type $B$ .”

Left cells and domino tableaux in classical Weyl groups

William M. McGovern (1996)

Compositio Mathematica

Similarity:

A sharp bound for the reconstruction of partitions.

Vatter, Vincent (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted.

Krattenthaler, C. (1995)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Decomposing complete tripartite graphs into closed trails of arbitrary lengths

Elizabeth J. Billington, Nicholas J. Cavenagh (2007)

Czechoslovak Mathematical Journal

Similarity:

The complete tripartite graph $K_{n, n, n}$ has $3 n^{2}$ edges. For any collection of positive integers $x_{1}, x_{2}, \dots, x_{m}$ with $\sum_{i = 1}^{m} x_{i} = 3 n^{2}$ and $x_{i} \geq 3$ for $1 \leq i \leq m$ , we exhibit an edge-disjoint decomposition of $K_{n, n, n}$ into closed trails (circuits) of lengths $x_{1}, x_{2}, \dots, x_{m}$ .