A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm
classification
🧮 math.CO
keywords
algorithmnovelli-pak-stoyanovskiicomplexityapplicationaspectsbehaviourconcerningconjecture
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.