A survey of stack-sorting disciplines
From MaRDI portal
Publication:1408520
zbMath1028.05003MaRDI QIDQ1408520
Publication date: 24 September 2003
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/123106
Related Items
Preimages under the stack-sorting algorithm ⋮ 2-stack sorting is polynomial ⋮ Pop-stack-sorting for Coxeter groups ⋮ Stack-sorting for Coxeter groups ⋮ A unified approach to polynomial sequences with only real zeros ⋮ The parallel stack loading problem to minimize blockages ⋮ Sorting by shuffling methods and a queue ⋮ Sorting Cayley permutations with pattern-avoiding machines ⋮ Sorting with networks of data structures ⋮ Catalan intervals and uniquely sorted permutations ⋮ How to sort by walking and swapping on paths and trees ⋮ Highly sorted permutations and Bell numbers ⋮ Lattice paths and \((n - 2)\)-stack sortable permutations ⋮ Polyurethane toggles ⋮ Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry ⋮ Dynamical aspects of \(\sigma\)-machines ⋮ Stack-sorting preimages of permutation classes ⋮ Uniquely sorted permutations ⋮ Quantifying noninvertibility in discrete dynamical systems ⋮ Permutations sortable by two stacks in parallel and quarter plane walks ⋮ Passing through a stack k times ⋮ Bubblesort, stacksort and their duals ⋮ Fertility monotonicity and average complexity of the stack-sorting map ⋮ Asymptotic normality in t-stack sortable permutations ⋮ Inglenook shunting puzzles ⋮ Enumeration of Stack-Sorting Preimages via a Decomposition Lemma ⋮ Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations ⋮ Actions on permutations and unimodality of descent polynomials ⋮ Simple permutations: Decidability and unavoidable substructures ⋮ Fertility, Strong Fertility, and Postorder Wilf Equivalence ⋮ Troupes, cumulants, and stack-sorting ⋮ Further bijections to pattern-avoiding valid hook configurations ⋮ New equivalences for pattern avoiding involutions ⋮ Asymptotics of 3-stack-sortable permutations ⋮ Stack-sorting with consecutive-pattern-avoiding stacks ⋮ Stack sorting with increasing and decreasing stacks ⋮ Finding and counting permutations via CSPs ⋮ Counting 3-stack-sortable permutations ⋮ On linear transformations preserving the Pólya frequency property ⋮ On minimum \(k\)-modal partitions of permutations ⋮ Meeting covered elements in \(\nu\)-Tamari lattices ⋮ Passing through a stack \(k\) times with reversals ⋮ Stack-sorting, set partitions, and Lassalle's sequence ⋮ Preimages under the bubblesort operator ⋮ Troupes, cumulants, and stack-sorting ⋮ Permuting machines and priority queues
This page was built for publication: A survey of stack-sorting disciplines
