A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm

作者：Neumann Christoph^*; Sulzgruber Robin

来源：Journal of Combinatorial Theory - Series A, 2015, 135: 85-104.

DOI：10.1016/j.jcta.2015.04.001

• Complexity
• Hook-length formula
• Young tableaux

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 imply a generalised version of a conjecture by Krattenthaler and Muller concerning the complexity of the Novelli-Pak-Stoyanovskii algorithm.

• 出版日期2015-10