A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm
Combinatorics
2017-01-03 v2
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.
Cite
@article{arxiv.1306.5134,
title = {A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm},
author = {Christoph Neumann and Robin Sulzgruber},
journal= {arXiv preprint arXiv:1306.5134},
year = {2017}
}
Comments
v2: 20 pages, 10 figures, final version (v1: 17 pages, 3 figures)