© Springer International Publishing AG, part of Springer Nature 2018. We prove that the set of permutations sorted by a stack of depth t ≥ 3 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
AbstractWe define an infinite permutation as a sequence of reals taken up to value, or, equivalently...
Cette thèse porte sur l'étude des classes de permutations à motifs exclus. Une analyse combinatoire ...
In 1968, Knuth introduced the stack sorting algorithm which attempts to chronologically sort an inpu...
We prove that the set of permutations generated by a stack of depth two and an infinite stack in ser...
AbstractThe permutations that can be sorted by two stacks in series are considered, subject to the c...
Sorting organizes information for optimal usage, and our work examines the mathematics behind sortin...
Involvement is a partial order on all finite permutations, of infinite dimension and having subsets ...
We prove that the class of permutations generated by passing an ordered sequence 12...n through a st...
Infinite antichains of permutations have long been used to construct interesting permutation classes...
We define an infinite permutation as a sequence of reals taken up to the order, or, equivalently, as...
AbstractThe paper is devoted to the properties of infinite permutations. We introduce the infinite p...
AbstractGiven a countable set X (usually taken to be N or Z), an infinite permutation π of X is a li...
AbstractIn his Ph.D. thesis, Julian West (Permutations with restricted subsequences and stack-sortab...
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permu...
We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, ...
AbstractWe define an infinite permutation as a sequence of reals taken up to value, or, equivalently...
Cette thèse porte sur l'étude des classes de permutations à motifs exclus. Une analyse combinatoire ...
In 1968, Knuth introduced the stack sorting algorithm which attempts to chronologically sort an inpu...
We prove that the set of permutations generated by a stack of depth two and an infinite stack in ser...
AbstractThe permutations that can be sorted by two stacks in series are considered, subject to the c...
Sorting organizes information for optimal usage, and our work examines the mathematics behind sortin...
Involvement is a partial order on all finite permutations, of infinite dimension and having subsets ...
We prove that the class of permutations generated by passing an ordered sequence 12...n through a st...
Infinite antichains of permutations have long been used to construct interesting permutation classes...
We define an infinite permutation as a sequence of reals taken up to the order, or, equivalently, as...
AbstractThe paper is devoted to the properties of infinite permutations. We introduce the infinite p...
AbstractGiven a countable set X (usually taken to be N or Z), an infinite permutation π of X is a li...
AbstractIn his Ph.D. thesis, Julian West (Permutations with restricted subsequences and stack-sortab...
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permu...
We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, ...
AbstractWe define an infinite permutation as a sequence of reals taken up to value, or, equivalently...
Cette thèse porte sur l'étude des classes de permutations à motifs exclus. Une analyse combinatoire ...
In 1968, Knuth introduced the stack sorting algorithm which attempts to chronologically sort an inpu...
DOI
Add to ORKG