(k,m)-Catalan numbers and hook length polynomials for plane trees
From MaRDI portal
Publication:875066
DOI10.1016/J.EJC.2006.01.011zbMATH Open1114.05005arXivmath/0501147OpenAlexW2036026446MaRDI QIDQ875066FDOQ875066
Publication date: 10 April 2007
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Abstract: Motivated by a formula of A. Postnikov relating binary trees, we define the hook length polynomials for m-ary trees and plane forests, and show that these polynomials have a simple binomial expression. An integer value of this expression is C_{k,m}(n)=frac{1}{mn+1}{(mn+1)k choose n}, which we call the (k,m)-Catalan number. For proving the hook length formulas, we also introduce a combinatorial family, (k,m)-ary trees, which are counted by the (k,m)-Catalan numbers.
Full work available at URL: https://arxiv.org/abs/math/0501147
Cites Work
- A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees
- Ordered structures and partitions
- Correspondences between plane trees and binary sequences
- A general bijective algorithm for increasing trees
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order
- Bruhat order on fixed-point-free involutions in the symmetric group
- Refined enumeration of noncrossing chains and hook formulas
- New hook length formulas for binary trees
- Hook length polynomials for plane forests of a certain type
- New hook length formulas for binary trees
- On Postnikov's hook length formula 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
- An insertion algorithm and leaders of rooted trees
This page was built for publication: \((k,m)\)-Catalan numbers and hook length polynomials for plane trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875066)
