Permutations sorted by a finite and an infinite stack in series
Combinatorics
2018-01-03 v2
Abstract
We prove that the set of permutations sorted by a stack of depth and an infinite stack in series has infinite basis, by constructing an infinite antichain. This answers an open question on identifying the point at which, in a sorting process with two stacks in series, the basis changes from finite to infinite.
Keywords
Cite
@article{arxiv.1711.06040,
title = {Permutations sorted by a finite and an infinite stack in series},
author = {Murray Elder and Yoong Kuan Goh},
journal= {arXiv preprint arXiv:1711.06040},
year = {2018}
}
Comments
12 pages, 9 figures, 1 table