On Han's hook length formulas for trees

zbMATH Open1250.05022arXiv1103.4068MaRDI QIDQ640404FDOQ640404

Peter L. Guo, William Y. C. Chen, Oliver X. Q. Gao

Publication date: 18 October 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: Recently, Han obtained two hook length formulas for binary trees and asked for combinatorial proofs. One of Han's formulas has been generalized to k-ary trees by Yang. Sagan has found a probabilistic proof of Yang's extension. We give combinatorial proofs of Yang's formula for k-ary trees and the other formula of Han for binary trees. Our bijections are based on the structure of k-ary trees with staircase labelings.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

combinatorial proofhook length formulak-ary treestaircase labeling

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• A unifying approach for proving hook-length formulas for weighted tree families
• Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees
• A multivariate hook formula for labelled trees
• On Postnikov's hook length formula for binary trees

Uses Software

• HookExp

   Recommendations

• Hook length formulas for trees by Han's expansion 👍 👎
• Probabilistic proofs of hook length formulas involving trees 👍 👎
• Bijective proofs of the hook formula for rooted trees. 👍 👎
• Two kinds of hook length formulas for complete \(m\)-ary trees 👍 👎
• A multivariate hook formula for labelled trees 👍 👎

This page was built for publication: On Han's hook length formulas for trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640404)