Unsplittable classes of separable permutations
classification
🧮 math.CO
keywords
classpermutationsseparablesubclassesunsplittablebasescharacteriseclasses
read the original abstract
A permutation class is splittable if it is contained in the merge of two of its proper subclasses. We characterise the unsplittable subclasses of the class of separable permutations both structurally and in terms of their bases.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.