Restricted stacks as functions

DOI10.1016/j.disc.2021.112571zbMath1472.05004arXiv2008.01164OpenAlexW3188898444MaRDI QIDQ1981702

Katalin Berlow

Publication date: 6 September 2021

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

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

zbMATH Keywords

permutationpattern avoidancestack sort

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05)

Related Items (5)

Stack-sorting for Coxeter groups ⋮ Sorting Cayley permutations with pattern-avoiding machines ⋮ Highly sorted permutations with respect to a 312-avoiding stack ⋮ Dynamical aspects of \(\sigma\)-machines ⋮ Stack-sorting with consecutive-pattern-avoiding stacks

Cites Work

• Unnamed Item
• Unnamed Item
• Stack-sorting, set partitions, and Lassalle's sequence
• Sorted and/or sortable permutations
• Catalan and Schröder permutations sortable by two restricted stacks
• Troupes, cumulants, and stack-sorting
• Fertility numbers
• Sorting with pattern-avoiding stacks: the \(132\)-machine
• Fertility monotonicity and average complexity of the stack-sorting map
• Stack sorting with restricted stacks
• Preimages under the stack-sorting algorithm
• Sorting Cayley permutations with pattern-avoiding machines
• Fertility, Strong Fertility, and Postorder Wilf Equivalence
• Sorting and preimages of pattern classes

This page was built for publication: Restricted stacks as functions