相关论文: Enumeration formulas for Young tableaux in a diago…
Using lattice path counting arguments, we reproduce a well known formula for the number of standard Young tableaux. We also produce an interesting new formula for tableaux of height $\leq 3$ using the Fourier methods of Ault and Kicey.
By considering the specialisation $s_{\lambda}(1,q,q^2,...,q^{n-1})$ of the Schur function, Stanley was able to describe a formula for the number of semistandard Young tableaux of shape $\lambda$ in terms of two properties of the boxes in…
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…
The number of standard Young tableaux of a fixed shape is famously given by the hook-length formula due to Frame, Robinson and Thrall. A bijective proof of Novelli, Pak and Stoyanovskii relies on a sorting algorithm akin to jeu-de-taquin…
The identities which are in the literature often called ``bounded Littlewood identities" are determinantal formulas for the sum of Schur functions indexed by partitions with bounded height. They have interesting combinatorial consequences…
We consider two examples of a fully decodable combinatorial encoding of Bernoulli schemes: the encoding via Weyl simplices and the much more complicated encoding via the RSK (Robinson--Schensted--Knuth) correspondence. In the first case,…
We study vectors formed by entries on the diagonal of standard Young tableaux of shifted shapes. Such vectors are in bijection with integer lattice points of certain integral polytopes, which are Minkowski sums of simplices. We also…
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…
We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…
We present a computer algebra approach to proving identities on Bernoulli polynomials and Euler polynomials by using the extended Zeilberger's algorithm given by Chen, Hou and Mu. The key idea is to use the contour integral definitions of…
We give a simple formula for some determinants, and an analogous formula for pfaffians, both of which are polynomial identities. The second involve some expressions that interpolate between determinants and pfaffians. We give several…
There are several isomorphic constructions for the irreducible polynomial representations of the general linear group in characteristic zero. The two most well-known versions are called Schur modules and Weyl modules. Steven Sam used a Weyl…
Quasi-Yamanouchi tableaux are a subset of semistandard Young tableaux and refine standard Young tableaux. They are closely tied to the descent set of standard Young tableaux and were introduced by Assaf and Searles to tighten Gessel's…
Permutation tableaux are combinatorial objects related with permutations and various statistics on them. They appeared in connection with total positivity in Grassmannians, and stationary probabilities in a PASEP model. In particular they…
We elaborate on the recent suggestion to consider averaging of Cauchy identities for the Schur functions over power sum variables. This procedure has apparent parallels with the Borel transform, only it changes the number of combinatorial…
For any polynomial representation of the special linear group, the nodes of the corresponding crystal may be indexed by semi-standard Young tableaux. Under certain conditions, the standard Young tableaux occur, and do so with weight 0.…
We are interested in the asymptotics of the number of standard Young tableaux $f^{\lambda/\mu}$ of a given skew shape $\lambda/\mu$. We mainly restrict ourselves to the case where both diagrams are balanced, but investigate all growth…
The study of permutation and partition statistics is a classical topic in enumerative combinatorics. The major index statistic on permutations was introduced a century ago by Percy MacMahon in his seminal works. In this extended abstract,…
A tableau inversion is a pair of entries in row-standard tableau $T$ that lie in the same column of $T$ yet lack the appropriate relative ordering to make $T$ column-standard. An $i$-inverted Young tableau is a row-standard tableau along…
Baryshnikov and Romik derived the combinatorial identities for the numbers of the $m$-strip tableaux. This generalized the classical Andr\'e's theorem for the number of up-down permutations. They asked for a bijective proof for the…