Related papers: Set-Valued Young Tableaux and Product-Coproduct Pr…
Canon permutations are permutations of the multiset having $k$ copies of each integer between $1$ and $n$, with the property that the subsequences obtained by taking the $j$th copy of each entry, for each fixed $j$, are all the same. For…
The classical hook length formula counts the number of standard tableaux of straight shapes. In 1996, Okounkov and Olshanski found a positive formula for the number of standard Young tableaux of a skew shape. We prove various properties of…
The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…
A Young diagram $Y$ is called wide if every sub-diagram $Z$ formed by a subset of the rows of $Y$ dominates $Z'$, the conjugate of $Z$. A Young diagram $Y$ is called Latin if its squares can be assigned numbers so that for each $i$, the…
A fundamental identity in the representation theory of the partition algeba is $n^k = \sum_{\lambda} f^\lambda m_k^\lambda$ for $n \geq 2k$, where $\lambda$ ranges over integer partitions of $n$, $f^\lambda$ is the number of standard Young…
A notion of cyclic descents on standard Young tableaux (SYT) of rectangular shape was introduced by Rhoades, and extended to certain skew shapes by the last two authors. The cyclic descent set restricts to the usual descent set when the…
A Latin tableau of shape $\lambda$ and type $\mu$ is a Young diagram of shape $\lambda$ in which each box contains a single positive integer, with no repeated integers in any row or column, and the $i$th most common integer appearing…
We introduce near triple arrays as binary row-column designs with at most two consecutive values for the replication numbers of symbols, for the intersection sizes of pairs of rows, pairs of columns and pairs of a row and a column. Near…
Combinatorial spiders are a model for the invariant space of the tensor product of representations. The basic objects, webs, are certain directed planar graphs with boundary; algebraic operations on representations correspond to…
A fundamental identity in the representation theory of the partition algebra is $n^k = \sum_{\lambda} f^\lambda m_k^\lambda$ for $n \geq 2k$, where $\lambda$ ranges over integer partitions of $n$, $f^\lambda$ is the number of standard Young…
Given a partition $\lambda$ of a number $k$, it is known that by adding a long line of length $n-k$, the dimension of the associated representation of $S_{n}$ is an integer-valued polynomial of degree $k$ in $n$. We show that its expansion…
We give a bijective proof that the Betti numbers of a minimal free resolution of the Stanley-Reisner ring of a cycle graph (viewed as a one-dimensional simplicial complex) are given by the number of standard Young tableaux of a given shape.
We study shifted standard Young tableaux (SYT). The limiting surface of uniformly random shifted SYT of staircase shape is determined, with the integers in the SYT as heights. This implies via properties of the Edelman-Greene bijection…
Three-dimensional Catalan numbers are a variant of the classical (bidimensional) Catalan numbers, that count, among other interesting objects, the standard Young tableaux of shape (n,n,n). In this paper, we present a structural bijection…
This thesis deals with three different aspects of the combinatorics of permutations. In the first two papers, two flavours of pattern avoiding permutations are examined; and in the third paper Young tableaux, which are closely related to…
There is a natural bijection between standard immaculate tableaux of composition shape $\alpha \vDash n$ and length $\ell(\alpha) = k$ and the $ \left\{ \begin{smallmatrix} n \\ k \end{smallmatrix} \right\} $ set-partitions of $\{ 1, 2,…
We consider a new kind of straight and shifted plane partitions/Young tableaux --- ones whose diagrams are no longer of partition shape, but rather Young diagrams with boxes erased from their upper right ends. We find formulas for the…
The celebrated hook-length formula gives a product formula for the number of standard Young tableaux of a straight shape. In 2014, Naruse announced a more general formula for the number of standard Young tableaux of skew shapes as a…
An increasing tableau is a semistandard tableau with strictly increasing rows and columns. It is well known that the Catalan numbers enumerate both rectangular standard Young tableaux of two rows and also Dyck paths. We generalize this to a…
Let $SYT_{n}$ be the set of all standard Young tableaux with $n$ cells and $\leq_{weak}$ be Melnikov's the weak order on $SYT_n$. The aim of this paper is to introduce a conjecture, called the {\it property of inner tableau translation} and…