Sorting Cayley permutations with pattern-avoiding machines

zbMath1468.05005arXiv2003.02536MaRDI QIDQ5000313

Giulio Cerbai

Publication date: 12 July 2021

Full work available at URL: https://arxiv.org/abs/2003.02536

zbMATH Keywords

sorting algorithms2 stacksort problem

Mathematics Subject Classification ID

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

Related Items (6)

Stack-sorting for Coxeter groups ⋮ Fishburn trees ⋮ Dynamical aspects of \(\sigma\)-machines ⋮ Restricted stacks as functions ⋮ Stack-sorting with consecutive-pattern-avoiding stacks ⋮ Transport of patterns by Burge transpose

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two stacks in series: a decreasing stack followed by an increasing stack
• Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
• Patterns in permutations and words.
• Sorting twice through a stack
• Cayley permutations
• A survey of stack-sorting disciplines
• Sorted and/or sortable permutations
• Restricted permutations and the wreath product
• Priority queues and multisets
• Restricted stacks as functions
• Catalan and Schröder permutations sortable by two restricted stacks
• Stack-sorting with consecutive-pattern-avoiding stacks
• Sorting with pattern-avoiding stacks: the \(132\)-machine
• Stack sorting with increasing and decreasing stacks
• Counting 3-stack-sortable permutations
• Stack sorting with restricted stacks
• Postorder Preimages
• Stack-sorting for Words
• Two-stack-sorting with pop stacks
• Enumerating permutations sortable by \(k\) passes through a pop-stack
• Permutations of a multiset avoiding permutations of length 3

This page was built for publication: Sorting Cayley permutations with pattern-avoiding machines