Skip to Main content Skip to Navigation
Conference papers

Symmetry properties of the Novelli-Pak-Stoyanovskii algorithm

Abstract : The number of standard Young tableaux of a fixed shape is famously given by the hook-length formula due to Frame, Robinson and Thrall. A bijective proof of Novelli, Pak and Stoyanovskii relies on a sorting algorithm akin to jeu-de-taquin which transforms an arbitrary filling of a partition into a standard Young tableau by exchanging adjacent entries. Recently, Krattenthaler and Müller defined the complexity of this algorithm as the average number of performed exchanges, and Neumann and the author proved it fulfils some nice symmetry properties. In this paper we recall and extend the previous results and provide new bijective proofs.
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, October 1, 2015 - 9:28:50 AM
Last modification on : Tuesday, March 7, 2017 - 3:26:39 PM
Long-term archiving on: : Saturday, January 2, 2016 - 10:51:03 AM


Publisher files allowed on an open archive




Robin Sulzgruber. Symmetry properties of the Novelli-Pak-Stoyanovskii algorithm. 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014), 2014, Chicago, United States. pp.205-216, ⟨10.46298/dmtcs.2393⟩. ⟨hal-01207583⟩



Record views


Files downloads