A Decreasing Stack and an Increasing Stack in Series
classification
🧮 math.CO
keywords
stackdecreasingmachineseriesaddedbasisbottomclass
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.