A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm

Authors :: Neumann, Christoph
Sulzgruber, Robin
Publication Year :: 2013
Abstract: 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\"uller concerning the complexity of the Novelli-Pak-Stoyanovskii algorithm as corollary.<br />Comment: v2: 20 pages, 10 figures, final version (v1: 17 pages, 3 figures)