Permutations generated by stacks and deques
From MaRDI portal
Publication:659569
DOI10.1007/S00026-010-0042-9zbMATH Open1233.05003OpenAlexW2077632363MaRDI QIDQ659569FDOQ659569
Steve Linton, Michael Albert, Mike Atkinson
Publication date: 24 January 2012
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-010-0042-9
Permutations, words, matrices (05A05) Formal languages and automata (68Q45) Asymptotic enumeration (05A16)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Restricted permutations
- On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Sorting Using Networks of Queues and Stacks
- Sorting with two ordered stacks in series.
- Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
- Permutations generated by token passing in graphs
- Regular closed sets of permutations.
Cited In (9)
- Passing through a stack \(k\) times with reversals
- Two stacks in series: a decreasing stack followed by an increasing stack
- Title not available (Why is that?)
- Stacking Blocks and Counting Permutations
- Passing through a stack k times
- 2-stack sorting is polynomial
- Permutations sortable by deques and by two stacks in parallel
- Permutations sortable by two stacks in series
- Stack-sorting preimages of permutation classes
This page was built for publication: Permutations generated by stacks and deques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659569)
