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öder numbers.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Albert M.H, Atkinson M, Linton S.: Permutations generated by stacks and deques. Ann. Combin. 14(1), 3–16 (2010)
Atkinson, M.D., Murphy, M.M., Ruškuc, N.: Sorting with two ordered stacks in series. Theoret. Comput. Sci. 289(1), 205–223 (2002)
Bóna M.: Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps. J. Combin. Theory Ser. A 80(2), 257–272 (1997)
Knuth, D.E.: The Art of Computer Programming. Volume 1. Addison-Wesley Publishing Co., Reading, Mass. (1969)
Kremer D.: Permutations with forbidden subsequences and a generalized Schröder number. Discrete Math. 218(1-3), 121–130 (2000)
Kremer, D.: Postscript: “Permutations with forbidden subsequences and a generalized Schröder number”. Discrete Math. 270(1-3), 333–334 (2003)
Murphy, M.M.: Restricted permutations, antichains, atomic classes, and stack sorting. PhD thesis, University of St Andrews, Fife (2002)
Author information
Authors and Affiliations
Corresponding author
Additional information
The author was partially supported by the NSA Young Investigator Grant H98230-08-1-0100.
Rights and permissions
About this article
Cite this article
Smith, R. Two Stacks in Series: A Decreasing Stack Followed by an Increasing Stack. Ann. Comb. 18, 359–363 (2014). https://doi.org/10.1007/s00026-014-0227-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00026-014-0227-8