Unsplittable classes of separable permutations
From MaRDI portal
Publication:2629491
zbMath1339.05002arXiv1605.01432MaRDI QIDQ2629491
Vít Jelínek, Michael Henry Albert
Publication date: 6 July 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.01432
Related Items (3)
The relation between composability and splittability of permutation classes ⋮ Longest monotone subsequences and rare regions of pattern-avoiding permutations ⋮ Generalized Coloring of Permutations
Cites Work
- Pattern matching for permutations
- Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
- Splittings and Ramsey properties of permutation classes
- Growth rates for subclasses of Av(321)
- Partially well-ordered closed sets of permutations
- Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
- Partitioning permutations into increasing and decreasing subsequences
- An Erd\H{o}s--Hajnal analogue for permutation classes
- Permutation classes
- A Survey of Simple Permutations
- A New Upper Bound for 1324-Avoiding Permutations
- On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation
- Ordering by Divisibility in Abstract Algebras
This page was built for publication: Unsplittable classes of separable permutations
