Pop-stack sorting and its image: permutations with overlapping runs

MaRDI QIDQ6621152FDOQ6621152

Authors: Andrei Asinowski, Cyril Banderier, Sara Billey, Benjamin Hackl, Svante Linusson 

Publication date: 18 October 2024

Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Recommendations

• Flip-sort and combinatorial aspects of pop-stack sorting
• Two-stack-sorting with pop stacks
• Sorting with a popqueue
• Counting Pop-Stacked Permutations in Polynomial Time
• The enumeration of permutations sortable by pop stacks in parallel

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Formal languages and automata (68Q45) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 2N noncollinear points determine at least 2N directions
• A combinatorial proof of J. West's conjecture
• Analytic combinatorics
• Bounds for sorting by prefix reversal
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Generating functions for generating trees
• Pop-stacks in parallel
• Separable \(d\)-permutations and guillotine partitions
• Sorting twice through a stack
• Two-stack-sorting with pop stacks

Cited In (4)

• Sorting with a popqueue
• A new lower bound for deterministic pop-stack-sorting
• Dynamics of pop-tsack torsing
• The Ungar games

This page was built for publication: Pop-stack sorting and its image: permutations with overlapping runs

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