Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees

DOI10.1137/080720498zbMath1191.05004arXiv0804.4268OpenAlexW2007061728MaRDI QIDQ3563932

Guo-Niu Han

Publication date: 1 June 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

binary treehook length formulaPostnikov's formula

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Related Items (2)

A unifying approach for proving hook-length formulas for weighted tree families ⋮ An insertion algorithm and leaders of rooted trees

Uses Software

• HookExp

This page was built for publication: Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees