相关论文: A determinant-like formula for the Kostka numbers
Young diagrams are fundamental combinatorial objects in representation theory and algebraic geometry. Many constructions that rely on these objects depend on variations of a straightening process that expresses a filling of a Young diagram…
We give new product formulas for the number of standard Young tableaux of certain skew shapes and for the principal evaluation of the certain Schubert polynomials. These are proved by utilizing symmetries for evaluations of factorial Schur…
Cylindric Young tableaux are combinatorial objects that first appeared in the 1990s. A natural extension of the classical notion of a Young tableau, they have since been used several times, most notably by Gessel and Krattenthaler and by…
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…
Using a 0/1 encoding of Young diagrams and its consequences for rim hook tableaux, we prove a reduction formula of Littlewood for arbitrary characters of the symmetric group, evaluated at elements with all cycle lengths divisible by a given…
The study of representations of affine Hecke algebras has led to a new notion of shapes and standard Young tableaux which works for the root system of any finite Coxeter group. This paper is completely independent of affine Hecke algebra…
This paper completely characterizes the standard Young tableaux that can be reconstructed from their sets or multisets of $1$-minors. In particular, any standard Young tableau with at least $5$ entries can be reconstructed from its set of…
We present a conjectual hook formula concerning the number of the standard tableaux on "cylindric" skew diagrams. Our formula can be seen as an extension of Naruse's hook formula for skew diagrams. Moreover, we prove our conjecture in some…
We obtain scaling and local limit results for large random Young tableaux of fixed shape $\lambda^0$ via the asymptotic analysis of a determinantal point process due to Gorin and Rahman (2019). More precisely, we prove: (1) an explicit…
The number of Young Tableaux whose shape is a k by n rectangle is famously (nk)! 0! ... (k-1)!/((n+k-1)!(n+k-2)!... n!) implying that for each specific k, that sequence satisfies a linear recurrence equation with polynomial coefficients of…
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…
We extend the polynomial approach to hook length formula proposed in a recent joint paper with K\'arolyi, Nagy and Volkov to several other problems of the same type, including number of paths formula in the Young graph of strict partitions.
Given two vectors $u$ and $v$, their outer sum is given by the matrix $A$ with entries $A_{ij} = u_{i} + v_{j}$. If the entries of $u$ and $v$ are increasing and sufficiently generic, the total ordering of the entries of the matrix is a…
An inverted semistandard Young tableau is a row-standard tableau along with a collection of inversion pairs that quantify how far the tableau is from being column semistandard. Such a tableau with precisely $k$ inversion pairs is said to be…
We derive new combinatorial identities which may be viewed as multivariate analogs of summation formulas for hypergeometric series. As in the previous paper [Re], we start with probability distributions on the space of the infinite Young…
In this note we introduce a determinant and then give its evaluating formula. The determinant turns out to be a generalization of the well-known ballot and Fuss-Catalan numbers, which is believed to be new. The evaluating formula is proved…
We define a statistic called the weight of oscillating tableaux. Oscillating tableaux, a generalization of standard Young tableaux, are certain walks in Young's lattice of partitions. The weight of an oscillating tableau is the sum of the…
We use the hook lengths of a partition to define two rectangular tableaux. We prove these tableaux have equal multisets of entries, first by elementary combinatorial arguments, and then using Stanley's Hook Content Formula and symmetric…
We present a new family of hook-length formulas for the number of standard increasing tableaux which arise in the study of factorial Grothendieck polynomials. In the case of straight shapes our formulas generalize the classical hook-length…
This note collects some facts and conjectures about the Hankel determinants and their generating functions of the columns of Hoggatt triangles which apparently are related to combinatorial objects such as Young tableaux and Narayana…