Polynomial Approach to Explicit Formulae for Generalized Binomial Coefficients

2015/04/04 by Fedor Petrov, Petrov, Fedor · 1 citation
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1504.01007

arxiv created 2015/04/04 · arxiv updated 2015/04/07

Abstract

We extend the polynomial approach to hook length formula proposed in a recent joint paper with Károlyi, Nagy and Volkov to several other problems of the same type, including number of paths formula in the Young graph of strict partitions.

Cited by

• Almost sure bounds for higher-order derivatives of first-passage percolation with respect to the environment

Related

• A combinatorial formula for certain binomial coefficients for Jack polynomials
• The method of characteristics, and "problem 89" of Graham, Knuth and Patashnik
• The Pak--Postnikov and Naruse skew hook length formulas: a new proof
• On the Hook Length Formula for Binary Trees
• Roots of descent polynomials and an algebraic inequality on hook lengths