English

Splittability and 1-amalgamability of permutation classes

Combinatorics 2023-06-22 v3

Abstract

A permutation class CC is splittable if it is contained in a merge of two of its proper subclasses, and it is 1-amalgamable if given two permutations σ\sigma and τ\tau in CC, each with a marked element, we can find a permutation π\pi in CC containing both σ\sigma and τ\tau 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 Av(1423,1342)Av(1423, 1342) 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.

Keywords

Cite

@article{arxiv.1704.08732,
  title  = {Splittability and 1-amalgamability of permutation classes},
  author = {Vít Jelínek and Michal Opler},
  journal= {arXiv preprint arXiv:1704.08732},
  year   = {2023}
}

Comments

17 pages, 7 figures

R2 v1 2026-06-22T19:30:16.890Z