A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm
From MaRDI portal
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.
Recommendations
- Asymptotic and exact results on the complexity of the Novelli-Pak-Stoyanovskii algorithm
- Symmetry properties of the Novelli-Pak-Stoyanovskii algorithm
- Arrays and the combinatorics of Young tableaux
- The Robinson-Schensted and Schützenberger algorithms, an elementary approach
- Finding the permutations corresponding to a given Young tableau
Cites work
- \(q\)-distributions on boxed plane partitions
- A symmetry theorem on a modified jeu de taquin
- scientific article; zbMATH DE number 1601795 (Why is no real title available?)
- scientific article; zbMATH DE number 1375571 (Why is no real title available?)
- scientific article; zbMATH DE number 1033192 (Why is no real title available?)
- Jeu de taquin dynamics on infinite Young tableaux and second class particles
- Random Sampling of Plane Partitions
- The Hook Graphs of the Symmetric Group
Cited in
(2)
This page was built for publication: A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491961)
