{"docId":239,"paperId":239,"url":"https:\/\/dmtcs.episciences.org\/239","doi":"10.46298\/dmtcs.239","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":68,"name":"Vol. 1"}],"section":[],"repositoryName":"Hal","repositoryIdentifier":"hal-00955690","repositoryVersion":1,"repositoryLink":"https:\/\/hal.science\/hal-00955690v1","dateSubmitted":"2015-03-26 16:17:03","dateAccepted":"2015-06-09 14:44:56","datePublished":"1997-01-01 08:00:00","titles":{"en":"A direct bijective proof of the hook-length formula"},"authors":["Novelli, Jean-Christophe","Pak, Igor","Stoyanovskii, Alexander V."],"abstracts":{"en":"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."},"keywords":[["Hook-length formula"],["bijective proof"],["inverse algorithms"],"[INFO.INFO-DM] Computer Science [cs]\/Discrete Mathematics [cs.DM]"]}