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.

Source : oai:HAL:hal-00955690v1

Volume: Vol. 1

Published on: January 1, 1997

Submitted on: March 26, 2015

Keywords: Hook-length formula,bijective proof,inverse algorithms,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

This page has been seen 399 times.

This article's PDF has been downloaded 462 times.