Explicit formulas for a sequence of binary tree polynomials

DOI10.1016/J.TCS.2012.05.033MaRDI QIDQ391427zbMATH OpenOpenAlexFDO

Authors Michele D'Adderio, Adriano M. Garsia

Publication date 10 January 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.05.033

zbMATH Keywords

shuffle conjectureHaglund-Morse-Zabrocki conjectures

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10)

Recommendations

• Hook length polynomials for plane forests of a certain type
• On Han's hook length formulas for trees
• Probabilistic proofs of hook length formulas involving trees
• Hook length formulas for trees by Han's expansion
• A multivariate hook formula for labelled trees

Cites work

• A combinatorial formula for the character of the diagonal coinvariants
• A compositional shuffle conjecture specifying touch points of the Dyck path

This page was built for publication: Explicit formulas for a sequence of binary tree polynomials

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