Generalizations of Han's Hook Length Identities
Abstract
Han recently discovered new hook length identities for binary trees. In this paper, we extend Han's identities to binomial families of trees. Moreover, we present a bijective proof of one of the identities for the family of ordered trees.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.