2014/03/20 by Robin Sulzgruber, Sulzgruber, Robin
Mathematics · #Advanced Combinatorial Mathematics #Algebraic structures and combinatorial models #Random Matrices and Applications #acm:05A17 #math.CO #msc:05A17
paper · pdf · doi:10.48550/arxiv.1403.5135
13 pages, 3 figure, submitted to FPSAC 2014 Chicago
arxiv created 2014/03/20 · arxiv updated 2014/03/21
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.