A direct bijective proof of the hook-length formula
Abstract
This paper presents a new proof of the hook-length formula, which computes the number of standard Young tableaux of a given shape. After recalling the basic definitions, we present two inverse algorithms giving the desired bijection. The next part of the paper presents the proof of the bijectivity of our construction. The paper concludes with some examples.
Domains
Discrete Mathematics [cs.DM]
Origin : Files produced by the author(s)
Loading...