Sorting by shuffling methods and a queue
From MaRDI portal
Publication:2161211
DOI10.37236/10334zbMath1494.05002arXiv2103.04332OpenAlexW4288689703MaRDI QIDQ2161211
Publication date: 4 August 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.04332
Searching and sorting (68P10) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Combinatorial probability (60C05)
Uses Software
Cites Work
- Pattern matching for permutations
- Permutations sortable by deques and by two stacks in parallel
- Analysis of casino shelf shuffling machines
- Patterns in permutations and words.
- The mathematics of mixing things up
- The mathematics of perfect shuffles
- Random shuffles and group representations
- 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)\)!)
- Permutations generated by token passing in graphs
- A survey of stack-sorting disciplines
- Regular closed sets of permutations.
- Affine shuffles, shuffles with cuts, the Whitehouse module, and patience sorting
- Generalized riffle shuffles and quasisymmetric functions
- Generating permutations with restricted containers
- Generating trees and the Catalan and Schröder numbers
- Short proofs for cut-and-paste sorting of permutations
- Combinatorics of Permutations
- A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions
- Shuffling Cards and Stopping Times
- Generating a random permutation with random transpositions
- Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations
- 50 Years of Combinatorics, Graph Theory, and Computing
- Sorting Using Networks of Queues and Stacks
- Magical Mathematics
- Restricted permutations
- Sorting a bridge hand
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sorting by shuffling methods and a queue
