Permutations generated by stacks and deques

DOI10.1007/S00026-010-0042-9MaRDI QIDQ659569zbMATH OpenOpenAlexFDO

Authors Mike Atkinson, Steve Linton, Michael 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

permutationenumerationgrowth ratedequeparallel stacksserial stacks

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
• 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.
• Restricted permutations
• Sorting Using Networks of Queues and Stacks
• Sorting with two ordered stacks in series.

Cited in

(9)

• Passing through a stack \(k\) times with reversals
• Two stacks in series: a decreasing stack followed by an increasing stack
• scientific article; zbMATH DE number 7362651 (Why is no real title available?)
• Stacking Blocks and Counting Permutations
• 2-stack sorting is polynomial
• Passing through a stack k times
• 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)