A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm
Christoph Neumann, Robin Sulzgruber
TL;DR
This paper analyzes the behavior of Young tableaux entries during the Novelli-Pak-Stoyanovskii algorithm, deriving theorems that generalize a conjecture on its complexity.
Contribution
It introduces two new theorems describing Young tableaux behavior and generalizes a conjecture on the algorithm's complexity.
Findings
Two theorems describing tableau behavior
Generalization of Krattenthaler and Müller's conjecture
Implications for algorithm complexity analysis
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Algebraic structures and combinatorial models · Random Matrices and Applications