Permutations generated by stacks and deques

DOI10.1007/s00026-010-0042-9zbMath1233.05003OpenAlexW2077632363MaRDI QIDQ659569

Steve Linton, M. D. Atkinson, Michael Henry Albert

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

zbMATH Keywords

enumerationgrowth ratepermutationdequeparallel stacksserial stacks

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Formal languages and automata (68Q45) Asymptotic enumeration (05A16)

Related Items (6)

2-stack sorting is polynomial ⋮ Permutations sortable by deques and by two stacks in parallel ⋮ Permutations sortable by two stacks in series ⋮ Two stacks in series: a decreasing stack followed by an increasing stack ⋮ Passing through a stack k times ⋮ Passing through a stack \(k\) times with reversals

Cites Work

• Unnamed Item
• Unnamed Item
• Excluded permutation matrices and the Stanley-Wilf conjecture
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• Permutations generated by token passing in graphs
• Regular closed sets of permutations.
• Sorting with two ordered stacks in series.
• Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
• Sorting Using Networks of Queues and Stacks
• Restricted permutations

This page was built for publication: Permutations generated by stacks and deques