Permutations sortable by two stacks in parallel and quarter plane walks
From MaRDI portal
Publication:458593
DOI10.1016/j.ejc.2014.08.024zbMath1301.05005OpenAlexW2058477139MaRDI QIDQ458593
Mireille Bousquet-Mélou, Michael Henry Albert
Publication date: 8 October 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2014.08.024
Searching and sorting (68P10) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)
Related Items
Permutations sortable by deques and by two stacks in parallel ⋮ Signed enumeration of upper-right corners in path shuffles ⋮ Permutations sortable by two stacks in series ⋮ Stack sorting with increasing and decreasing stacks ⋮ Enumerating permutations sortable by \(k\) passes through a pop-stack ⋮ Finding and counting permutations via CSPs ⋮ Enumerating permutations sortable by \(k\) passes through a pop-stack ⋮ Exact solution of some quarter plane walks with interacting boundaries ⋮ Permutations generated by a depth 2 stack and an infinite stack in series are algebraic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-D-finite excursions in the quarter plane
- A fast approach to creative telescoping
- Walks in the quarter plane: Kreweras' algebraic model
- Patterns in permutations and words.
- Holomorphic functions of several variables. An introduction to the fundamental theory. With the assist. of Gottfried Barthel transl. by Michael Bridgland
- Bijective counting of tree-rooted maps and shuffles of parenthesis systems
- Shuffle of parenthesis systems and Baxter permutations
- A survey of stack-sorting disciplines
- On the functions counting walks with small steps in the quarter plane
- Combinatorics of Permutations
- Some exact asymptotics in the counting of walks in the quarter-plane
- Walks with small steps in the quarter plane
- Proof of Ira Gessel's lattice path conjecture
- A Census of Hamiltonian Polygons
- Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
- Asymptotic Methods in Enumeration
- GFUN
- The complete generating function for Gessel walks is algebraic
- Sorting Using Networks of Queues and Stacks