@article{Bousquet, Author = {M. Bousquet-M\'elou and A. Jehanne}, Journal = {J. Combin. Theory Ser. B}, Number = {}, Pages = {623--672}, Title = {Polynomial equations with one catalytic variable, algebraic series and map enumeration}, Volume = {96}, Year = {2006}} @article{DefantCounting, Author = {C. Defant}, Journal = {J. Combin. Theory Ser. A}, Number = {}, Pages = {}, Title = {Counting $3$-stack-sortable permutations}, doi = {10.1016/j.jcta.2020.105209}, Volume = {172}, Year = {2020}} @misc{DefantEnumeration, AUTHOR = {C. Defant}, EPRINT = {1904.02829}, EPRINTTYPE = {arxiv}, TITLE = {Enumeration of stack-sorting preimages via a decomposition lemma}, YEAR = {2019}} @article{DefantMonotonicity, Author = {C. Defant}, Journal = {}, Number = {}, Pages = {}, Title = {Fertility monotonicity and average complexity of the stack-sorting map}, note = {arXiv: \href{https://arxiv.org/abs/2003.05935}{2003.05935}. To appear in \emph{European J. Combin.}}, Volume = {}, Year = {2021}} @article{DefantPreimages, Author = {C. Defant}, Journal = {Graphs Combin.}, Number = {}, Pages = {103--122}, Title = {Preimages under the stack-sorting algorithm}, Volume = {33}, Year = {2017}} @misc{DefantTroupes, AUTHOR = {C. Defant}, EPRINT = {2004.11367}, EPRINTTYPE = {arxiv}, TITLE = {Troupes, cumulants, and stack-sorting}, YEAR = {2020}} @misc{DefantElveyPrice, AUTHOR = {C. Defant and A. Elvey Price and A. J. Guttmann}, EPRINT = {2009.10439}, EPRINTTYPE = {arxiv}, TITLE = {Asymptotics of 3-stack-sortable permutations}, YEAR = {2020}} @book{Knuth, TITLE = {The art of computer programming, volume 1}, SUBTITLE = {Fundamental algorithms}, AUTHOR = {D. E. Knuth}, YEAR = {1968}, PUBLISHER = {Addison-Wesley}} @article{Kremer, Author = {D. Kremer}, Journal = {Discrete Math.}, Number = {}, Pages = {121--130}, Title = {Permutations with forbidden subsequences and a generalized Schr\"oder number}, Volume = {218}, Year = {2000}} @article{Smith, Author = {R. Smith}, Journal = {Ann. Comb.}, Number = {}, Pages = {113--121}, Title = {Comparing algorithms for sorting with $t$ stacks in series}, Volume = {8}, Year = {2004}} @article{Ulfarsson, Author = {H. \'Ulfarsson}, Journal = {S\'em. Lothar. Combin.}, Number = {}, Pages = {}, Title = {Describing West-$3$-stack-sortable permutations with permutation patterns}, Volume = {67}, Year = {2012}} @phdthesis{West, author = {J. West}, title = {Permutations with restricted subsequences and stack-sortable permutations}, school = {MIT}, year = {1990}} @article{Zeilberger, Author = {D. Zeilberger}, Journal = {Discrete Math.}, Number = {1}, Pages = {85--93}, Title = {A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length $n$ is $2(3n)!/((n + 1)!(2n + 1)!)$}, doi = {10.1016/0012-365X(92)90351-F}, Volume = {102}, Year = {1992}}