How Many Pop-Stacks Does It Take To Sort A Permutation?-Reference-Cited by-同舟云学术

How Many Pop-Stacks Does It Take To Sort A Permutation?

Published:2021-07-06 Issue: Volume: Page:
ISSN:0010-4620
Container-title:The Computer Journal
language:en
Short-container-title:

Author:

Albert Michael¹,Vatter Vincent²

Affiliation:

1. Department of Computer Science, University of Otago, Dunedin 9054, New Zealand

2. Department of Mathematics, University of Florida, Gainesville, FL 32611, USA

Abstract

Abstract Pop-stacks are variants of stacks that were introduced by Avis and Newborn in 1981. Coincidentally, a 1982 result of Unger implies that every permutation of length $n$ can be sorted by $n-1$ passes through a deterministic pop-stack. We give a new proof of this result inspired by Knuth’s zero-one principle.

Funder

Simons Foundation

Publisher

Oxford University Press (OUP)

Subject

General Computer Science

Link

http://academic.oup.com/comjnl/advance-article-pdf/doi/10.1093/comjnl/bxab092/38872562/bxab092.pdf

Reference15 articles.

1. Sorting twice through a stack;West;Theoret. Comput. Sci.,1993

2. A proof of Julian West’s conjecture that the number of two-stack-sortable permutations of length n is 2(3n)!/((n+1)!(2n+1)!);Zeilberger;Discrete Math.,1992

3. On pop-stacks in series;Avis;Utilitas Math.,1981

4. 2N noncollinear points determine at least 2N directions;Ungar;J. Combin. Theory Ser. A,1982

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A new lower bound for deterministic pop-stack-sorting;European Journal of Combinatorics;2025-02

2. Crystal pop-stack sorting and type A crystal lattices;European Journal of Combinatorics;2022-06

3. Meeting covered elements in ν-Tamari lattices;Advances in Applied Mathematics;2022-03