Symmetry properties of the Novelli-Pak-Stoyanovskii algorithm

Robin Sulzgruber (1)

1 Universität Wien = University of Vienna

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.

Mots clés: complexity; hook-length formula; Young tableaux

Domaines: Mathématique discrète [cs.DM]; Combinatoire [math.CO]

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⟩