Symmetry properties of the Novelli-Pak-Stoyanovskii algorithm - Archive ouverte HAL
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2014

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.
Fichier principal
Vignette du fichier
dmAT0119.pdf (327.1 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01207583 , version 1 (01-10-2015)

Identifiers

Cite

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⟩

Collections

TDS-MACS
173 View
631 Download

Altmetric

Share

More