Two kinds of hook length formulas for complete \(m\)-ary trees (Q1025531): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On Postnikov's hook length formula for binary trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: \((k,m)\)-Catalan numbers and hook length polynomials for plane trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees / rank | |||
Normal rank | |||
Latest revision as of 17:11, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two kinds of hook length formulas for complete \(m\)-ary trees |
scientific article |
Statements
Two kinds of hook length formulas for complete \(m\)-ary trees (English)
0 references
19 June 2009
0 references
hook length formulas
0 references
\(m\)-ary trees
0 references
