Permutations sortable by deques and by two stacks in parallel
Andrew Elvey Price, Anthony J. Guttmann

TL;DR
This paper relates the enumeration of permutations sortable by deques to those sortable by two stacks in parallel, using functional equations, and explores their asymptotic behaviors and generating functions.
Contribution
It establishes a connection between deque and two-stack in parallel permutation sorting problems via functional equations and analyzes their asymptotic properties.
Findings
Radius of convergence of generating functions is conjectured to be the same.
Coefficients for deque and tsip generating functions exhibit different asymptotic behaviors.
Numerical estimates of constants and exponents for asymptotic formulas are provided.
Abstract
Recently Albert and Bousquet-M\'elou \cite{AB15} obtained the solution to the long-standing problem of the number of permutations sortable by two stacks in parallel (tsip). Their solution was expressed in terms of functional equations. We show that the equally long-standing problem of the number of permutations sortable by a double-ended queue (deque) can be simply related to the solution of the same functional equations. Subject to plausible, but unproved, conditions, the radius of convergence of both generating functions is the same. Numerical work confirms this conjecture to 10 significant digits. Further numerical work suggests that the coefficients of the deque generating function behave as where while the coefficients of the corresponding tsip generating function behave as …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
