Hook length formulas for trees by Han's expansion

MaRDI QIDQ1028843zbMATH OpenFDO

Authors William Y. C. Chen, Oliver X. Q. Gao, Peter L. Guo

Publication date 8 July 2009

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0903.3342, https://eudml.org/doc/117520, http://www.emis.de/journals/EJC/Volume_16/Abstracts/v16i1r62.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

\(k\)-ary treesgenerating functionhook length formulas for treeslabeled treesplane treesweight function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Trees (05C05) Signed and weighted graphs (05C22)

Abstract: Recently Han obtained a general formula for the weight function corresponding to the expansion of a generating function in terms of hook lengths of binary trees. In this paper, we present formulas for k-ary trees, plane trees, plane forests, labeled trees and forests. We also find appropriate generating functions which lead to unifications of the hook length formulas due to Du and Liu, Han, Gessel and Seo, and Postnikov.

Review text

Summary: Recently Han obtained a general formula for the weight function corresponding to the expansion of a series in terms of hook lengths of binary trees. In this paper, we present weight function formulas for \(k\)-ary trees, plane trees, plane forests, labeled trees and forests. We also find appropriate generating functions which lead to unifications of the hook length formulas due to \textit{R.R.X. Du} and \textit{F. Liu} [``\((k,m)\)-Catalan numbers and hook length polynomials for plane trees, Eur. J. Comb. 28, No.\,4, 1312--1321 (2007; Zbl 1114.05005)], \textit{G.-N. Han} [``Discovering hook length formulas by an expansion technique, Electron. J. Comb. 15, No.\,1, Res. Paper R133 (2008; Zbl 1165.05305)], \textit{I.M. Gessel}, \textit{B. Sagan}, and \textit{Y.-N. Seo} [``Enumeration of trees by inversions, J. Graph Theory 19, No.\,4, 435--459 (1995; Zbl 0833.05045)], and \textit{A. Postnikov} [``Permutohedra, associahedra, and beyond, Int. Math. Res. Not. 2009, No.\,6, 1026--1106 (2009; Zbl 1162.52007)].

Recommendations

• On Han's hook length formulas for trees
• A multivariate hook formula for labelled trees
• A unifying approach for proving hook-length formulas for weighted tree families
• Probabilistic proofs of hook length formulas involving trees
• Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees

Cited in

(17)

• Discovering hook length formulas by an expansion technique
• Two kinds of hook length formulas for complete \(m\)-ary trees
• Rooted forests that avoid sets of permutations
• A unifying approach for proving hook-length formulas for weighted tree families
• Probabilistic proofs of hook length formulas involving trees
• Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees
• Explicit formulas for a sequence of binary tree polynomials
• scientific article; zbMATH DE number 6806786 (Why is no real title available?)
• An edge-weighted hook formula for labelled trees
• Combinatorial families of multilabelled increasing trees and hook-length formulas
• Parking functions, tree depth and factorizations of the full cycle into transpositions
• On Han's hook length formulas for trees
• Bilabelled increasing trees and hook-length formulae
• Hook length polynomials for plane forests of a certain type
• Some equidistributed statistics and applications to hook length formulas
• Tree hook length formulae, Feynman rules and B-series
• On Postnikov's hook length formula for binary trees

Describes a project that uses

Uses Software

• HookExp

This page was built for publication: Hook length formulas for trees by Han's expansion

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