Periodic points of consecutive-pattern-avoiding stack-sorting maps
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2107707 (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 consecutive patterns in permutations
- A survey of stack-sorting disciplines
- Catalan and Schröder permutations sortable by two restricted stacks
- Catalan intervals and uniquely sorted permutations
- Counting 3-stack-sortable permutations
- Dynamical aspects of \(\sigma\)-machines
- Fertility numbers
- Generating permutations with restricted containers
- Highly sorted permutations with respect to a 312-avoiding stack
- Multi-static enumeration of two-stack sortable permutations
- Patterns in permutations and words.
- Permutations sortable by \(n - 4\) passes through a stack
- Preimages under the stack-sorting algorithm
- Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
- Restricted stacks as functions
- Sorted and/or sortable permutations
- Sorting with pattern-avoiding stacks: the 132-machine
- Stack sorting with restricted stacks
- Stack-sorting with consecutive-pattern-avoiding stacks
- Stack-sorting, set partitions, and Lassalle's sequence
- The order of the (123, 132)-avoiding stack sort
- Troupes, cumulants, and stack-sorting
This page was built for publication: Periodic points of consecutive-pattern-avoiding stack-sorting maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6857927)
