Dynamical aspects of \(\sigma\)-machines

DOI10.1016/j.disc.2023.113486arXiv2210.06075MaRDI QIDQ6098077

Giulio Cerbai

Publication date: 12 June 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

permutation patternsstack sorting\(\sigma\)-machine

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Theory of data (68Pxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two stacks in series: a decreasing stack followed by an increasing stack
• Pattern avoidance in ascent sequences
• Sorting twice through a stack
• Stack-sorting, set partitions, and Lassalle's sequence
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• A survey of stack-sorting disciplines
• Sorted and/or sortable permutations
• Restricted stacks as functions
• Catalan and Schröder permutations sortable by two restricted stacks
• Stack-sorting with consecutive-pattern-avoiding stacks
• Transport of patterns by Burge transpose
• Catalan intervals and uniquely sorted permutations
• Descents in \(t\)-sorted permutations
• Sorting with pattern-avoiding stacks: the \(132\)-machine
• Stack sorting with increasing and decreasing stacks
• Stack sorting with restricted stacks
• 2-stack sorting is polynomial
• Sorting Cayley permutations with pattern-avoiding machines

This page was built for publication: Dynamical aspects of \(\sigma\)-machines