English
Related papers

Related papers: Hook-content formula using excited Young diagrams

200 papers

Using equivariant cohomology theory, Naruse obtained a hook length formula for the number of standard Young tableaux of skew shape $\lambda/\mu$. Morales, Pak and Panova found two $q$-analogues of Naruse's formula respectively by counting…

Combinatorics · Mathematics 2017-11-09 Peter L. Guo , C. D. Zhao , Michael X. X. Zhong

We introduce the difference operator for functions defined on strict partitions and prove a polynomiality property for a summation involving the hook length and content statistics. As an application, several new hook-content formulas for…

Combinatorics · Mathematics 2016-12-14 Guo-Niu Han , Huan Xiong

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…

Combinatorics · Mathematics 2019-08-15 Peter S. Campbell , Anna Stokke

We extend a classical construction on symmetric functions, the superization process, to several combinatorial Hopf algebras, and obtain analogs of the hook-content formula for the (q,t)-specializations of various bases. Exploiting the…

Combinatorics · Mathematics 2013-02-12 Jean-Christophe Novelli , Jean-Yves Thibon

We give combinatorial descriptions of the restrictions to T-fixed points of the classes of structure sheaves of Schubert varieties in the T-equivariant K-theory of Grassmannians and of maximal isotropic Grassmannians of orthogonal and…

Combinatorics · Mathematics 2013-03-06 William Graham , Victor Kreiman

This paper provides a primer in quantum field theory (QFT) based on Hopf algebra and describes new Hopf algebraic constructions inspired by QFT concepts. The following QFT concepts are introduced: chronological products, S-matrix, Feynman…

High Energy Physics - Theory · Physics 2014-11-18 Christian Brouder

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…

Combinatorics · Mathematics 2009-03-20 William Y. C. Chen , Oliver X. Q. Gao , Peter L. Guo

The hook length formula for $d$-complete posets states that the $P$-partition generating function for them is given by a product in terms of hook lengths. We give a new proof of the hook length formula using $q$-integrals. The proof is done…

Combinatorics · Mathematics 2019-02-18 Jang Soo Kim , Meesue Yoo

Recently, a simple proof of the hook length formula was given via the branching rule. In this paper, we extend the results to shifted tableaux. We give a bijective proof of the branching rule for the hook lengths for shifted tableaux;…

Combinatorics · Mathematics 2010-06-24 Matjaz Konvalinka

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…

Combinatorics · Mathematics 2018-06-06 Jang Soo Kim , Meesue Yoo

Using Littlewood's map, which decomposes a partition into its $r$-core and $r$-quotient, Han and Ji have shown that many well-known hook-length formulas admit modular analogues. In this paper we present a variant of the Han-Ji…

Combinatorics · Mathematics 2021-05-19 Adam Walsh , S. Ole Warnaar

Matrices over a finite field having fixed rank and restricted support are a natural $q$-analogue of rook placements on a board. We develop this $q$-rook theory by defining a corresponding analogue of the hit numbers. Using tools from coding…

Combinatorics · Mathematics 2021-03-30 Joel Brewster Lewis , Alejandro H. Morales

Language-integrated query techniques have been explored in a number of different language designs. We consider two different, type-safe approaches employed by Links and F#. Both approaches provide rich dynamic query generation capabilities,…

Programming Languages · Computer Science 2014-04-14 James Cheney , Sam Lindley , Gabriel Radanne , Philip Wadler

A multiset hook length formula for integer partitions is established by using combinatorial manipulation. As special cases, we rederive three hook length formulas, two of them obtained by Nekrasov-Okounkov, the third one by Iqbal, Nazir,…

Combinatorics · Mathematics 2011-05-10 Paul-Olivier Dehaye , Guo-Niu Han

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.

Combinatorics · Mathematics 2025-07-02 Tirtharaj Basu , Aritra Bhattacharya

We relate hook-length products for adjacent staircase partitions to special values of Jacobi polynomials. This connection expresses the number of semistandard tableaux in terms of Jacobi polynomials defined via Gauss hypergeometric…

Combinatorics · Mathematics 2026-01-12 Tatsushi Shimazaki

We present an encoding and decoding scheme for constant weight sequences, that is, given an information sequence, the construction results in a sequence of specific weight within a certain range. The scheme uses a prefix design that is…

Information Theory · Computer Science 2017-06-06 Elie Ngomseu Mambou , Theo G. Swart

We consider short range correlations in excited states of the finite XXZ and XXX Heisenberg spin chains. We conjecture that the known results for the factorized ground state correlations can be applied to the excited states too, if the…

Statistical Mechanics · Physics 2017-02-01 B. Pozsgay

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.

Combinatorics · Mathematics 2022-01-10 Shaun V. Ault

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…

Combinatorics · Mathematics 2010-03-16 Amitai Regev