Symmetry properties of the Novelli-Pak-Stoyanovskii algorithm

From MaRDI portal
Publication:4584101

zbMATH Open1393.05295MaRDI QIDQ4584101FDOQ4584101


Authors: Robin Sulzgruber Edit this on Wikidata

Publication date: 29 August 2018

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"uller 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.


Full work available at URL: https://arxiv.org/abs/1403.5135




Recommendations





Cited In (9)





This page was built for publication: Symmetry properties of the Novelli-Pak-Stoyanovskii algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584101)