On a conjecture on pattern-avoiding machines

DOI10.1007/S00026-024-00693-3MaRDI QIDQ7005020zbMATH OpenFDO

Authors Christopher Bao, Giulio Cerbai, Yunseo Choi, Katelyn Gan, Owen Zhang

Publication date 2 April 2025

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00026-024-00693-3

zbMATH Keywords

\((\sigma, \tau)\)-machineWest's stack-sorting map

Mathematics Subject Classification ID

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

Cites work

• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• 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)\)!)
• Catalan and Schröder permutations sortable by two restricted stacks
• Classification of bijections between 321- and 132-avoiding permutations
• Generating trees and the Catalan and Schröder numbers
• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
• On a correspondence between binary trees and a certain type of permutation
• Restricted stacks as functions
• Sorting Cayley permutations with pattern-avoiding machines
• Sorting with pattern-avoiding stacks: the 132-machine
• Stack sorting with restricted stacks
• Stack-sortable permutations and beyond
• Stack-sorting with consecutive-pattern-avoiding stacks

Cited in

(2)

• The order of the (123, 132)-avoiding stack sort
• Pattern-avoiding modified ascent sequences

This page was built for publication: On a conjecture on pattern-avoiding machines

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