Sorting with pattern-avoiding stacks: the \(132\)-machine

DOI10.37236/9642zbMath1446.05003arXiv2006.05692OpenAlexW3083001871MaRDI QIDQ2194083

Anders Claesson, Einar Steingrímsson, Giulio Cerbai, Luca Ferrari

Publication date: 25 August 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

pattern-avoiding sorting machines

Mathematics Subject Classification ID

Searching and sorting (68P10) Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)

Related Items (6)

Stack-sorting for Coxeter groups ⋮ Sorting Cayley permutations with pattern-avoiding machines ⋮ Dynamical aspects of \(\sigma\)-machines ⋮ Restricted stacks as functions ⋮ Catalan and Schröder permutations sortable by two restricted stacks ⋮ Stack-sorting with consecutive-pattern-avoiding stacks

Uses Software

• OEIS

Cites Work

• 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
• On pattern-avoiding partitions
• Combinatorial aspects of continued fractions
• Dyck path enumeration
• Restricted growth function patterns and statistics
• Enumerative results on the Schröder pattern poset
• Stack sorting with restricted stacks
• ECO:a methodology for the enumeration of combinatorial objects
• Riordan arrays, generalized Narayana triangles, and series reversion

This page was built for publication: Sorting with pattern-avoiding stacks: the \(132\)-machine