Probabilistic proofs of hook length formulas involving trees
| dc.creator | Sagan, Bruce E. | |
| dc.date | 2008-05-07 | |
| dc.date | 2008-06-12 | |
| dc.date.accessioned | 2026-07-07T09:43:53Z | |
| dc.date.available | 2026-07-07T09:43:53Z | |
| dc.description | Recently, Han discovered two formulas involving binary trees which have the interestig property that hooklengths appear as exponents. The purpose of this note is to give a probabilistic proof of one of Han's formulas. Yang has generalized Han's results to ordered trees. We show how the probabilistic approach can also be used in Yang's setting, as well as for a generalization of Han's formula in terms of certain infinite trees. | |
| dc.description | Final version with proofs, 6 figures, and a section on open problems added | |
| dc.identifier | https://arxiv.org/abs/0805.0817 | |
| dc.identifier | http://arxiv.org/abs/0805.0817 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/162682 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A19 | |
| dc.title | Probabilistic proofs of hook length formulas involving trees | |
| dc.type | text |