Probabilistic proofs of hook length formulas involving trees

zbMath1230.05045arXiv0805.0817MaRDI QIDQ2654630

Bruce E. Sagan

Publication date: 20 January 2010

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0805.0817

zbMATH Keywords

treealgorithmprobabilityhook length

Mathematics Subject Classification ID

Trees (05C05) Combinatorial identities, bijective combinatorics (05A19) Combinatorial probability (60C05)

Related Items (7)

A unifying approach for proving hook-length formulas for weighted tree families ⋮ Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications ⋮ An insertion algorithm and leaders of rooted trees ⋮ Bilabelled increasing trees and hook-length formulae ⋮ New hook length formulas for binary trees ⋮ New hook length formulas for binary trees ⋮ Unnamed Item

This page was built for publication: Probabilistic proofs of hook length formulas involving trees