Stack-sorting with stacks avoiding vincular patterns
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5729471 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- 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)\)!)
- A survey of stack-sorting disciplines
- Catalan and Schröder permutations sortable by two restricted stacks
- Combinatorial exploration: an algorithmic framework for enumeration
- Counting 3-stack-sortable permutations
- Dynamical aspects of \(\sigma\)-machines
- Fertility numbers
- Generalized pattern avoidance
- Generalized permutation patterns and a classification of the Mahonian statistics
- Generating trees and the Catalan and Schröder numbers
- Highly sorted permutations with respect to a 312-avoiding stack
- Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
- Modular Catalan numbers
- Preimages under the stack-sorting algorithm
- Restricted permutations
- Restricted stacks as functions
- Sorting with pattern-avoiding stacks: the 132-machine
- Stack sorting with restricted stacks
- Stack-sorting with consecutive-pattern-avoiding stacks
This page was built for publication: Stack-sorting with stacks avoiding vincular patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883692)