The relation between composability and splittability of permutation classes
From MaRDI portal
Publication:2659183
Abstract: A permutation class is said to be splittable if there exist two proper subclasses such that any can be red-blue colored so that the red (respectively, blue) subsequence of is order isomorphic to an element of (respectively, ). The class is said to be composable if there exists some number of proper subclasses such that any can be written as for some . We answer a question of Karpilovskij by showing that there exists a composable permutation class that is not splittable. We also give a condition under which an infinite composable class must be splittable.
Recommendations
Cites work
Cited in
(6)- Composability of permutation classes
- Unsplittable classes of separable permutations
- On Commutation Properties of the Composition Relation of Convergent and Divergent Permutations (Part I)
- Splittability and 1-amalgamability of permutation classes
- Splittings and Ramsey properties of permutation classes
- Splitting the relative assembly map, nil-terms and involutions
This page was built for publication: The relation between composability and splittability of permutation classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2659183)