A unifying approach for proving hook-length formulas for weighted tree families (Q2637731): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00373-012-1217-4 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: HookExp / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-012-1217-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054766372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hook length formulas for trees by Han's expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of trees by inversions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refinement of Cayley's formula for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New hook length formulas for binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discovering hook length formulas by an expansion technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average shape of monotonically labelled tree structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariance principles for random bipartite planar maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Altitude of Nodes in Random Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bijections for ternary trees and non-crossing trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutohedra, Associahedra, and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: On monotone functions of tree structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic proofs of hook length formulas involving trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00373-012-1217-4 / rank
 
Normal rank

Latest revision as of 12:57, 19 December 2024

scientific article
Language Label Description Also known as
English
A unifying approach for proving hook-length formulas for weighted tree families
scientific article

    Statements

    A unifying approach for proving hook-length formulas for weighted tree families (English)
    0 references
    0 references
    0 references
    14 February 2014
    0 references
    There has been much recent activity on hook-length formulas for trees [\textit{G.-N. Han}, Combinatorica 30, No. 2, 253--256 (2010; Zbl 1250.05017); \textit{W. Y. C. Chen} et al., Electron. J. Comb. 16, No. 1, Research Paper R62, 16 p. (2009; Zbl 1180.05007); \textit{L. L. M. Yang}, ``Generalizations of Han's hook length identities'', Preprint, \url{arXiv:0805.0109}]. This paper unifies and extends earlier results for hook-length formulas for trees by expanding the concept to weighted tree families.
    0 references
    hook-length formula
    0 references
    weighted tree
    0 references
    simply generated trees
    0 references
    increasing trees
    0 references

    Identifiers