A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm

DOI10.1016/j.jcta.2015.04.001zbMath1319.05144arXiv1306.5134OpenAlexW1502677437MaRDI QIDQ491961

Robin Sulzgruber, Christoph Neumann

Publication date: 19 August 2015

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.5134

zbMATH Keywords

complexityYoung tableauxhook-length formula

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10)

Related Items

Asymptotic and exact results on the complexity of the Novelli-Pak-Stoyanovskii algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(q\)-distributions on boxed plane partitions
• A symmetry theorem on a modified jeu de taquin
• Jeu de taquin dynamics on infinite Young tableaux and second class particles
• Random Sampling of Plane Partitions
• The Hook Graphs of the Symmetric Group