Presented By: Student Combinatorics Seminar - Department of Mathematics
a Bijective Proof of the Hook-Length Formula
Diya Yang
We are going to see a direct bijective proof of the hook-length formula by J.-C. Novelli, I. Pak, and A. V. Stoyanovskii, which involves designing a bijective algorithm that relates any tableau of shape $\lambda$ (filling of [n] with no restrictions) to a unique standard Young tableau of shape $\lambda$ paired with a hook function.
Co-Sponsored By
