\((k,m)\)-Catalan numbers and hook length polynomials for plane trees

DOI10.1016/j.ejc.2006.01.011zbMath1114.05005arXivmath/0501147OpenAlexW2036026446MaRDI QIDQ875066

Rosena R. X. Du, Fu Liu

Publication date: 10 April 2007

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

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

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (10)

Bruhat order on fixed-point-free involutions in the symmetric group ⋮ Refined enumeration of noncrossing chains and hook formulas ⋮ An insertion algorithm and leaders of rooted trees ⋮ Hook length polynomials for plane forests of a certain type ⋮ On Postnikov's hook length formula for binary trees ⋮ New hook length formulas for binary trees ⋮ New hook length formulas for binary trees ⋮ Two kinds of hook length formulas for complete \(m\)-ary trees ⋮ Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order ⋮ Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees
• Correspondences between plane trees and binary sequences
• Ordered structures and partitions

This page was built for publication: \((k,m)\)-Catalan numbers and hook length polynomials for plane trees