Article ID Journal Published Year Pages File Type
4655187 Journal of Combinatorial Theory, Series A 2015 20 Pages PDF
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 imply a generalised version of a conjecture by Krattenthaler and Müller concerning the complexity of the Novelli–Pak–Stoyanovskii algorithm.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A complexity theorem for the Novelli–Pak–Stoyanovskii algorithm
Authors
, ,