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

MaRDI QIDQ6621152FDOQ6621152

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

Publication date: 18 October 2024

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

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

Cited In (3)

• 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)