The relation between composability and splittability of permutation classes

From MaRDI portal
Publication:2659183



Abstract: A permutation class C is said to be splittable if there exist two proper subclasses A,BsubsetneqC such that any sigmainC can be red-blue colored so that the red (respectively, blue) subsequence of sigma is order isomorphic to an element of A (respectively, B). The class C is said to be composable if there exists some number of proper subclasses A1,dots,AksubsetneqC such that any sigmainC can be written as alpha1circdotscircalphak for some alphaiinAi. 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.












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)