Related papers: A determinant-like formula for the Kostka numbers
We consider two questions of Wilf related to Standard Young Tableaux. We provide a partial answer to one question, and that will lead us to a more general answer to the other question. Our answers are purely combinatorial.
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 evaluate a determinant of generalized Fibonacci numbers, thus providing a common generalization of several determinant evaluation results that have previously appeared in the literature, all of them extending Cassini's identity for…
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…
These notes are designed to offer some (perhaps new) codicils to related work, a list of problems and conjectures seeking (preferably) combinatorial proofs. The main items are Eulerian polynomials and hook/contents of Young diagram, mostly…
We give a new (inductive) proof of the classical Frobenius--Young correspondence between irreducible complex representations of the symmetric group and Young diagrams, using the new approach, suggested in \cite{OV, VO}, to determining this…
We provide a formula for the Garsia-Remmel $q$-rook numbers as a sum over standard Young tableaux. We connect our formula with the coefficients in $q$-Whittaker expansion of unicellular LLT functions.
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…
We study the Gaussent-Littelmann formula for Hall-Littlewood polynomials and we develop combinatorial tools to describe the formula in a purely combinatorial way for type A_n, B_n and C_n. This description is in terms of Young tableaux and…
We give a counting formula for the set of rectangular increasing tableaux in terms of generalized Narayana numbers. We define small $m$-Schr\"oder paths and give a bijection between the set of increasing rectangular tableaux and small…
We present formulas for the homogenous multivariate resultant as a quotient of two determinants. They extend classical Macaulay formulas, and involve matrices of considerably smaller size, whose non zero entries include coefficients of the…
We describe a formula for computing the product of the Young symmetrizer of a Young tableau with the Young symmetrizer of a subtableau, generalizing the classical quasi-idempotence of Young symmetrizers. We derive some consequences to the…
Recently Blasiak gave a combinatorial rule for the Kronecker coefficient $g_{\lambda \mu \nu}$ when $\mu$ is a hook shape by defining a set of colored Yamanouchi tableaux with cardinality $g_{\lambda\mu\nu}$ in terms of a process called…
We show that certain weighted average of the alpha-determinant of a $kn$ by $kn$ matrix of the form $A\otimes1_{1,k}$, the Kronecker product of a $kn$ by $n$ matrix $A$ and $1$ by $k$ all one matrix $1_{1,k}$, over permutations of $kn$…
We introduce lecture hall tableaux, which are fillings of a skew Young diagram satisfying certain conditions. Lecture hall tableaux generalize both lecture hall partitions and anti-lecture hall compositions, and also contain reverse…
The Macdonald polynomials expanded in terms of a modified Schur function basis have coefficients called the $q,t$-Kostka polynomials. We define operators to build standard tableaux and show that they are equivalent to creation operators…
A class of determinants is introduced. Different kind of mathematical objects, such as Fibonacci, Lucas, Tchebychev, Hermite, Laguerre, Legendre polynomials, sums and covergents are represented as determinants from this class. A closed…
We describe two aspects of the behaviour of entries of Young tableaux during the application of the Novelli-Pak-Stoyanovskii algorithm. We derive two theorems which both contain a generalized version of a conjecture by Krattenthaler and…
Standard tableaux of skew shape are fundamental objects in enumerative and algebraic combinatorics and no product formula for the number is known. In 2014, Naruse gave a formula (NHLF) as a positive sum over excited diagrams of products of…
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,…