A new lower bound for deterministic pop-stack-sorting

DOI10.1016/J.EJC.2024.104046MaRDI QIDQ6655684zbMATH OpenFDO

Authors Morgan Bauer, Keith Copenhaver

Publication date 27 December 2024

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2024.104046

zbMATH Keywords

pop-stack-sorting processrandom permutations

Mathematics Subject Classification ID

Combinatorial probability (60C05) Stochastic processes (60G99)

Recommendations

• Pop-stack sorting and its image: permutations with overlapping runs
• Flip-sort and combinatorial aspects of pop-stack sorting
• Sorting twice through a stack
• Sorting with a popqueue
• \(k\)-pop stack sortable permutations and \(2\)-avoidance

Cites work

• 2N noncollinear points determine at least 2N directions
• Counting Pop-Stacked Permutations in Polynomial Time
• Coxeter pop-tsack torsing
• Enumerating permutations sortable by \(k\) passes through a pop-stack
• Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
• Fertility monotonicity and average complexity of the stack-sorting map
• Flip-sort and combinatorial aspects of pop-stack sorting
• scientific article; zbMATH DE number 3722110 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Meeting covered elements in -Tamari lattices
• Pop-stack sorting and its image: permutations with overlapping runs
• Pop-stack-sorting for Coxeter groups
• The pop-stack-sorting operator on Tamari lattices

This page was built for publication: A new lower bound for deterministic pop-stack-sorting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655684)