相关论文: Identities for the number of standard Young tablea…

We prove a formula for $S_n$ characters which are indexed by the partitions in the $(k,\ell)$ hook. The proof applies a combinatorial part of the theory of Lie superalgebras.

The Naruse hook-length formula is a recent general formula for the number of standard Young tableaux of skew shapes, given as a positive sum over excited diagrams of products of hook-lengths. In 2015 we gave two different $q$-analogues of…

Unexpected product formulas for the number of standard Young tableaux of certain truncated shapes are found and proved. These include shifted staircase shapes minus a square in the NE corner, rectangular shapes minus a square in the NE…

Given a subset S of R^n, let c(S,k) be the smallest number t such that whenever finitely many convex sets have exactly k common points in S, there exist at most t of these sets that already have exactly k common points in S. For S = Z^n,…

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 derive combinatorial identities, involving the Bernoulli and Euler numbers, for the numbers of standard Young tableaux of certain skew shapes. This generalizes the classical formulas of D. Andre on the number of up-down permutations. The…

The tableau reconstruction problem, posed by Monks (2009), asks the following. Starting with a standard Young tableau $T$, a 1-minor of $T$ is a tableau obtained by first deleting any cell of $T$, and then performing jeu de taquin slides to…

This paper shows that the number of hooks of length k contained in all partitions of n equals k times the number of parts of length k in all partitions of n. It contains also formulas for the moments (under uniform distribution) of k-th…

Let T^* be a standard Young tableau of k cells. We show that the probability that a Young tableau of n cells contains T^* as a subtableau is, in the limit n -> \infty, equal to \nu(\pi(T^*))/k!, where \pi(T^*) is the shape (= Ferrers…

The problem of decomposing the Kronecker product of $S_n$ characters is one of the last major open problems in the ordinary representation theory of the symmetric group $S_n$. Here we prove upper and lower polynomial bounds for the…

Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in S_n which contain a given permutation \tau in S_k as a subsequence; this number depends on the patterns of the first j values of \tau for 1<=j<=k. We…

This paper deals with the distribution of descent number in standard Young tableaux of certain shapes. A simple explicit formula is presented for the number of tableaux of any shape with two rows, with any specified number of descents. For…

The classical hook length formula of enumerative combinatorics expresses the number of standard Young tableaux of a given partition shape as a single fraction. In recent years, two generalizations of this formula have emerged: one by Pak…

For $\ell \geq 1$ and $k \geq 2$, we consider certain admissible sequences of $k-1$ lattice paths in a colored $\ell \times \ell$ square. We show that the number of such admissible sequences of lattice paths is given by the sum of squares…

We calculate the number of humps and peaks in Motzkin paths with a given height, and calculate the number of standard Young tableaux (SYTs) in a $(2,1)$-hook with the difference of the first two parts fixed, which refine Regev's results in…

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…

Standard set-valued Young tableaux are a generalization of standard Young tableaux where cells can contain unordered sets of integers, with the added condition that every integer at position $(i,j)$ must be smaller that every integer at…

For their bijective proof of the hook-length formula for the number of standard tableaux of a fixed shape Novelli, Pak and Stoyanovskii define a modified jeu de taquin which transforms an arbitrary filling of the Ferrers diagram with…

Let SYT_n be the set of all standard Young tableaux with n cells. After recalling the definitions of four partial orders, the weak, KL, geometric and chain orders on SYT_n and some of their crucial properties, we prove three main results:…

In this paper, we present a direct bijective proof of the hook-length formula for standard immaculate tableaux, which arose in the study of non-commutative symmetric functions. Our proof is along the spirit of Novelli, Pak and…