Highly sorted permutations with respect to a 312-avoiding stack

DOI10.54550/eca2023v3s1r7zbMath1512.05011OpenAlexW4313652135MaRDI QIDQ6097074

Unnamed Author, Yunseo Choi

Publication date: 12 June 2023

Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.54550/eca2023v3s1r7

zbMATH Keywords

permutationpattern avoidancestack sort

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• 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)\)!)
• 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
• Troupes, cumulants, and stack-sorting
• Fertility numbers
• Counting 3-stack-sortable permutations
• Stack sorting with restricted stacks
• Highly sorted permutations and Bell numbers

This page was built for publication: Highly sorted permutations with respect to a 312-avoiding stack