Polynomial approach to explicit formulae for generalized binomial coefficients

DOI10.1007/S40879-016-0099-ZzbMATH Open1339.05034arXiv1504.01007OpenAlexW1812186740MaRDI QIDQ300486FDOQ300486

Authors: F. V. Petrov 

Publication date: 28 June 2016

Published in: European Journal of Mathematics (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1504.01007

Recommendations

• Generalized binomial coefficients and Macdonald polynomials
• \(q\)-hook formula of Gansner type for a generalized Young diagram
• Polynomiality of some hook-length statistics
• scientific article
• scientific article

zbMATH Keywords

polynomial identitiescombinatorial nullstellensatzgeneralized binomial coefficientsgraded graphmultidimensional interpolation

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Combinatorial aspects of commutative algebra (05E40) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Representations of finite symmetric groups (20C30)

Cites Work

• Shifted Jack polynomials, binomial formula, and applications
• Two Notes on Notation
• Combinatorial Nullstellensatz
• On Newton interpolation of symmetric functions: A characterization of interpolation Macdonald polynomials
• An addition theorem and maximal zero-sum free sets in \(\mathbb{Z}/p\mathbb{Z}\)
• The polynomial method and restricted sums of congruence classes
• Partitions of nonzero elements of a finite field into pairs
• Erratum to: ``An addition theorem and maximal zero-sum free sets in \(\mathbb Z/p\mathbb Z\)
• Dimensions of skew-shifted Young diagrams and projective characters of the infinite symmetric group
• Harmonic functions on multiplicative graphs and interpolation polynomials
• A new approach to constant term identities and Selberg-type integrals
• A simple proof of the Zeilberger-Bressoud \(q\)-Dyson theorem
• Title not available (Why is that?)
• Viewing determinants as nonintersecting lattice paths yields classical determinantal identities bijectively
• The Hook Graphs of the Symmetric Group
• A combinatorial problem
• A generalization of combinatorial Nullstellensatz

Cited In (6)

• Asymptotics of traces of paths in the Young and Schur graphs
• Asymptotic behavior of normalized dimensions of standard and strict Young diagrams -- growth and oscillations
• Application of a composition of generating functions for obtaining explicit formulas of polynomials
• Explicit formula for generalization of poly-Bernoulli numbers and polynomials with a,b,c parameters
• Generating polynomials for the distribution of generalized binomial coefficients in discrete valuation domains
• A dual of colored tilings terminating sums

This page was built for publication: Polynomial approach to explicit formulae for generalized binomial coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300486)