Sorting permutations using a pop stack with a bypass

DOI10.1016/J.DISC.2025.114964MaRDI QIDQ6857917zbMATH OpenFDO

Authors Lapo Cioni, L. Ferrari, Rebecca Smith

Publication date 16 February 2026

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

permutationenumerationlattice pathpermutation patternsorting algorithmpop stack

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Searching and sorting (68P10)

Cites work

• scientific article; zbMATH DE number 3722110 (Why is no real title available?)
• scientific article; zbMATH DE number 3238653 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Burstein’s permutation conjecture, Hong and Li’s inversion sequence conjecture and restricted Eulerian distributions
• Combinatorial exploration: an algorithmic framework for enumeration
• Enumerating permutations sortable by \(k\) passes through a pop-stack
• Finding regular insertion encodings for permutation classes
• Length-four pattern avoidance in inversion sequences
• On the inverse image of pattern classes under bubble sort
• Pop-stacks in parallel
• Postorder Preimages
• Preimages under the Queuesort algorithm
• Preimages under the bubblesort operator
• Restricted permutations
• Sorted and/or sortable permutations
• Sorting Cayley permutations with pattern-avoiding machines
• Sorting inversion sequences
• Sorting with a popqueue
• Stack-sorting preimages of permutation classes
• The On-Line Encyclopedia of Integer Sequences
• The enumeration of permutations sortable by pop stacks in parallel
• Two-stack-sorting with pop stacks

This page was built for publication: Sorting permutations using a pop stack with a bypass

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