Counting Pop-Stacked Permutations in Polynomial Time

DOI10.1080/10586458.2021.1926001zbMath1519.05013arXiv1908.08910OpenAlexW3173231288MaRDI QIDQ6042966

Anders Claesson, Bjarki Agust Gudmundsson, Jay Pantone

Publication date: 4 May 2023

Published in: Experimental Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

enumerationpolynomial time algorithmdifferential approximationautomated fittingpop-stacked permutation

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Numerical aspects of recurrence relations (65Q30)

Related Items (5)

Pop-stack-sorting for Coxeter groups ⋮ Stack-sorting for Coxeter groups ⋮ The image of the pop operator on various lattices ⋮ Semidistrim Lattices ⋮ Meeting covered elements in \(\nu\)-Tamari lattices

Cites Work

• Unnamed Item
• Extended rate, more GFUN
• Pop-stacks in parallel
• High-order differential approximants
• A stack and a pop stack in series
• Series Analysis
• GFUN
• Two-stack-sorting with pop stacks
• Enumerating permutations sortable by \(k\) passes through a pop-stack

This page was built for publication: Counting Pop-Stacked Permutations in Polynomial Time