2013/06/21 by Christoph Neumann, Neumann, Christoph, Robin Sulzgruber +1
Mathematics · #05A17 #Advanced Combinatorial Mathematics #Algebraic structures and combinatorial models #Combinatorics (math.CO) #FOS: Mathematics #Random Matrices and Applications
paper · pdf · doi:10.48550/arxiv.1306.5134
openalex publication_date 2013/06/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We describe two aspects of the behaviour of entries of Young tableaux during the application of the Novelli-Pak-Stoyanovskii algorithm. We derive two theorems which both contain a generalized version of a conjecture by Krattenthaler and Müller concerning the complexity of the Novelli-Pak-Stoyanovskii algorithm as corollary.