Enumerating permutations sortable by \(k\) passes through a pop-stack

zbMath1414.05007MaRDI QIDQ5925190

Anders Claesson, Bjarki Agust Gudmundsson

Publication date: 15 May 2019

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: http://www.mat.univie.ac.at/~slc/wpapers/FPSAC2018//43-Claesson-Gudmundsson.html

zbMATH Keywords

sortablegenerating functionenumerationpermutationlanguagerationalpop-stack

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items

\(k\)-pop stack sortable permutations and \(2\)-avoidance, Unnamed Item, Enumerating permutations sortable by \(k\) passes through a pop-stack, Enumerating permutations sortable by \(k\) passes through a pop-stack, Two-stack-sorting with pop stacks

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permutations sortable by two stacks in parallel and quarter plane walks
• Describing West-3-stack-sortable permutations with permutation patterns
• The enumeration of permutations sortable by pop stacks in parallel
• A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!)
• Pop-stacks in parallel
• Restricted permutations and the wreath product
• The insertion encoding of permutations
• On the definition of a family of automata
• Two-stack-sorting with pop stacks
• Sorting Using Networks of Queues and Stacks
• Enumerating permutations sortable by \(k\) passes through a pop-stack