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

zbMath1366.05119arXiv1606.07597MaRDI QIDQ2628258

Robin Sulzgruber, Carsten Schneider

Publication date: 13 June 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

standard Young tableausymbolic summationhook-length formulaaverage case and worst case complexityNovelli-Pak-Stoyanovskii algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Combinatorial aspects of representation theory (05E10) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Related Items (4)

Bijecting hidden symmetries for skew staircase shapes ⋮ On parking functions and the zeta map in types \(B\), \(C\) and \(D\) ⋮ Some natural extensions of the parking space ⋮ Term Algebras, Canonical Representations and Difference Ring Theory for Symbolic Summation

Uses Software

• SIGMA
• EvaluateMultiSums
• GeneratingFunctions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Calculating three loop ladder and \(V\)-topologies for massive operator matrix elements by computer algebra
• A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm
• A difference ring theory for symbolic summation
• A variational problem for random Young tableaux
• Summation theory. II: Characterizations of \(R {\Pi}{\Sigma}^{\ast}\)-extensions and algorithmic aspects
• Another involution principle-free bijective proof of Stanley's hook-content formula
• A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
• Symbolic summation assists combinatorics
• Summation in Finite Terms
• Simplifying Multiple Sums in Difference Fields
• The Hook Graphs of the Symmetric Group
• XXVI.—The Monomial Expansion of Determinantal Symmetric Functions

This page was built for publication: Asymptotic and exact results on the complexity of the Novelli-Pak-Stoyanovskii algorithm