Highly sorted permutations and Bell numbers

DOI10.54550/ECA2021V1S1R6zbMath1491.05005arXiv2012.03869OpenAlexW3208341985MaRDI QIDQ5093421

Colin Defant

Publication date: 26 July 2022

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

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

zbMATH Keywords

Bell numbersstack-sortinghighly sorted permutation

Mathematics Subject Classification ID

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

Related Items (2)

Highly sorted permutations with respect to a 312-avoiding stack ⋮ A lift of West's stack-sorting map to partition diagrams

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permutations sortable by \(n - 4\) passes through a stack
• Describing West-3-stack-sortable permutations with permutation patterns
• Stack-sorting, set partitions, and Lassalle's sequence
• 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)\)!)
• Generating functions for generating trees
• A survey of stack-sorting disciplines
• Sorted and/or sortable permutations
• Troupes, cumulants, and stack-sorting
• Catalan intervals and uniquely sorted permutations
• Descents in \(t\)-sorted permutations
• Fertility monotonicity and average complexity of the stack-sorting map
• Counting 3-stack-sortable permutations
• Combinatorics of Permutations
• Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations

This page was built for publication: Highly sorted permutations and Bell numbers