Related papers: Hook formulas for skew shapes IV. Increasing table…
The hook length formula gives a product formula for the number of standard Young tableaux of a partition shape. The number of standard Young tableaux of a skew shape does not always have a product formula. However, for some special skew…
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…
The original motivation for study for hook length polynomials was to find a combinatorial proof for a hook length formula for binary trees given by Postnikov, as well as a proof for a hook length polynomial formula conjectured by Lascoux.…
This paper gives a tableau formula for expanding the product of a Lascoux polynomial and a stable Grothendieck polynomial into Lascoux polynomials. Lascoux and stable Grothendieck polynomials are inhomogeneous analogues of key polynomials…
In this paper, we study Grothendieck polynomials from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials, analogues of the factorial Schur functions and present some of their properties, and use them to produce a…
We prove a formula for the structure sheaf of a quiver variety in the Grothendieck ring of its embedding variety. This formula generalizes and gives new expressions for Grothendieck polynomials. We furthermore conjecture that the…
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.
Closed formulas are known for $S(k,0;n)$, the number of standard Young tableaux of size $n$ and with at most $k$ parts, where $1\le k\le 5$. Here we study the analogue problem for $S(k,\ell;n)$, the number of standard Young tableaux of size…
In this paper, we take interest in finding applications for a hook-length formula recently proved in (Morales Pak Panova 2016). This formula can be applied to give a non trivial relation between alternating permutations and weighted Dyck…
Nakada's colored hook formula is a vast generalization of many important formulae in combinatorics, such as the classical hook length formula and the Peterson's formula for the number of reduced expressions of minuscule Weyl group elements.…
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 study the Pieri type formulas for the Schur multiple zeta functions along with those for the Schur polynomials. To formulate these formulas, we introduce a new insertion rule for adding boxes in the Young tableaux and obtain the results…
Recently Han obtained a general formula for the weight function corresponding to the expansion of a generating function in terms of hook lengths of binary trees. In this paper, we present formulas for k-ary trees, plane trees, plane…
We give an algebraic proof of the determinant formulas for factorial Grothendieck polynomials obtained by Hudson--Ikeda--Matsumura--Naruse and by Hudson--Matsumura.
Combinatorial formulas expressing cyclic rook polynomials and cyclic permanents of rectangular matrices in terms of expansions along rows are presented
We give new formulas for Grothendieck polynomials of two types. One type expresses any specialization of a Grothendieck polynomial in at least two sets of variables as a linear combination of products Grothendieck polynomials in each set of…
We produce a new basis for the Schur and Weyl modules associated to a row-convex shape, D. The basis is indexed by new class of "straight" tableaux which we introduce by weakening the usual requirements for standard tableaux. Spanning is…
In this short note we discuss recent results on hook length formulas of trees unifying some earlier results, and explain hook length formulas naturally associated to families of increasingly labelled trees.
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…
We present a bijective proof of the hook-length formula for shifted standard tableaux of a fixed shape based on a modified jeu de taquin and the ideas of the bijective proof of the hook-length formula for ordinary standard tableaux by…