Two stacks in series: a decreasing stack followed by an increasing stack
From MaRDI portal
Abstract: We study a sorting machine consisting of two stacks in series where the first stack has the added restriction such that entries in the stack must be in decreasing order from top to bottom. We give the basis of the class of permutations that are sortable by this machine which shows that it is enumerated by the Schr"oder numbers.
Recommendations
Cites work
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Permutations generated by stacks and deques
- Permutations with forbidden subsequences and a generalized Schröder number
- Postscript: ``Permutations with forbidden subsequences and a generalized Schröder number [Discrete Mathematics 218 (2000) 121--130]
- Sorting with two ordered stacks in series.
Cited in
(16)- Passing through a stack k times
- Sorting with a popqueue
- Sorting with two ordered stacks in series.
- A stack and pop stack in series
- Two-stack-sorting with pop stacks
- Sorting Cayley permutations with pattern-avoiding machines
- Passing through a stack \(k\) times with reversals
- Catalan and Schröder permutations sortable by two restricted stacks
- Sorting with pattern-avoiding stacks: the \(132\)-machine
- 2-stack sorting is polynomial
- Permutations sorted by a finite and an infinite stack in series
- Stack sorting with increasing and decreasing stacks
- Stack sorting with restricted stacks
- A bijection on classes enumerated by the Schröder numbers
- Dynamical aspects of \(\sigma\)-machines
- Permutations sortable by two stacks in series
This page was built for publication: Two stacks in series: a decreasing stack followed by an increasing stack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404476)