Explicit formulas for a sequence of binary tree polynomials

DOI10.1016/j.tcs.2012.05.033zbMath1301.05362OpenAlexW2048580819MaRDI QIDQ391427

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) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Planar graphs; geometric and topological aspects of graph theory (05C10)

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