(k,m)-Catalan numbers and hook length polynomials for plane trees
From MaRDI portal
(Redirected from Publication:875066)
\((k,m)\)-Catalan numbers and hook length polynomials for plane trees
\((k,m)\)-Catalan numbers and hook length polynomials for plane trees
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.
Recommendations
- Two kinds of hook length formulas for complete \(m\)-ary trees
- Hook length polynomials for plane forests of a certain type
- On Han's hook length formulas for trees
- Sur les polynômes de Catalan simples et doubles. (On simple and double Catalan polynomials)
- A multivariate hook formula for labelled trees
Cites work
- scientific article; zbMATH DE number 3821741 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees
- A general bijective algorithm for increasing trees
- Correspondences between plane trees and binary sequences
- Ordered structures and partitions
Cited in
(12)- Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order
- Bruhat order on fixed-point-free involutions in the symmetric group
- A refinement of the formula for \(k\)-ary trees and the Gould-Vandermonde's convolution
- Refined enumeration of \(k\)-plane trees and \(k\)-noncrossing trees
- 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
- On Postnikov's hook length formula 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
- 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)
