Explicit formulas for a sequence of binary tree polynomials
Theor. Comput. Sci., pp. 217-226, 2013.
Haglund-Morse-Zabrocki conjecturepartition caseexplicit formulacomplete planar treecompositional caseMore(6+)
The W-ary tree corresponding to a word W=w"0w"1...w"k is the complete planar tree whose nodes at level i have out-degree w"i. Investigating some combinatorial aspects of the Shuffle conjecture (Haglund et al. (2005) ), Hicks recently discovered (Hicks (2012) ) a remarkable family of univariate polynomials associated to W-ary trees. ...More
Full Text (Upload PDF)
PPT (Upload PPT)