Enumerating permutations sortable by k passes through a pop-stack

MaRDI QIDQ5925190zbMATH OpenFDO

Authors 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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

enumerationgenerating functionlanguagepermutationpop-stackrationalsortable

Mathematics Subject Classification ID

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

Recommendations

• Enumerating permutations sortable by \(k\) passes through a pop-stack
• The enumeration of permutations sortable by pop stacks in parallel
• Stack-sortable permutations and beyond
• \(k\)-pop stack sortable permutations and \(2\)-avoidance
• Permutations sortable by \(n - 4\) passes through a stack
• Counting Pop-Stacked Permutations in Polynomial Time
• A survey of stack sortable permutations
• Multi-static enumeration of two-stack sortable permutations
• Stack-sortable permutations and polynomials
• Permutations sorted by a finite and an infinite stack in series

Cites work

• 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)\)!)
• Describing West-3-stack-sortable permutations with permutation patterns
• Enumerating permutations sortable by k passes through a pop-stack
• scientific article; zbMATH DE number 3722110 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• On the definition of a family of automata
• Permutations sortable by two stacks in parallel and quarter plane walks
• Pop-stacks in parallel
• Restricted permutations and the wreath product
• Sorting Using Networks of Queues and Stacks
• The enumeration of permutations sortable by pop stacks in parallel
• The insertion encoding of permutations
• Two-stack-sorting with pop stacks

Cited in

(10)

• Passing through a stack \(k\) times with reversals
• \(k\)-pop stack sortable permutations and \(2\)-avoidance
• Passing through a stack k times
• Flip-sort and combinatorial aspects of pop-stack sorting
• Two-stack-sorting with pop stacks
• Enumerating permutations sortable by \(k\) passes through a pop-stack
• Enumerating permutations sortable by k passes through a pop-stack
• Counting Pop-Stacked Permutations in Polynomial Time
• Permutations sortable by \(n - 4\) passes through a stack
• The enumeration of permutations sortable by pop stacks in parallel

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Enumerating permutations sortable by \(k\) passes through a pop-stack

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925190)