Splittability and 1-amalgamability of permutation classes
From MaRDI portal
Abstract: A permutation class is splittable if it is contained in a merge of two of its proper subclasses, and it is 1-amalgamable if given two permutations and in , each with a marked element, we can find a permutation in containing both and such that the two marked elements coincide. It was previously shown that unsplittability implies 1-amalgamability. We prove that unsplittability and 1-amalgamability are not equivalent properties of permutation classes by showing that the class is both splittable and 1-amalgamable. Our construction is based on the concept of LR-inflations, which we introduce here and which may be of independent interest.
Recommendations
Cited in
(5)
This page was built for publication: Splittability and 1-amalgamability of permutation classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560186)