A unifying approach for proving hook-length formulas for weighted tree families (Q2637731): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| 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 | |||
Revision as of 01:03, 20 March 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
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
