pith. sign in

arxiv: math/0504260 · v1 · submitted 2005-04-13 · 🧮 math.CO

On the Hook Length Formula for Binary Trees

classification 🧮 math.CO
keywords binaryformulahooklengthtreescombinatorialpostnikovproof
0
0 comments X
read the original abstract

We present a simple combinatorial proof of Postnikov's hook length formula for binary trees.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.