English

The purity phenomenon for symmetric separated set-systems

Combinatorics 2022-05-03 v2

Abstract

Let nn be a positive integer. A collection S\cal S of subsets of [n]={1,,n}[n]=\{1,\ldots,n\} is called {\it symmetric} if XSX\in {\cal S} implies XSX^\ast\in {\cal S}, where X:={i[n] ⁣:ni+1X}X^\ast:=\{i\in [n]\colon n-i+1\notin X\}. We show that in each of the three types of separation relations: {\it strong}, {\it weak} and {\it chord} ones, the following "purity phenomenon" takes place: all inclusion-wise maximal symmetric separated collections in 2[n]2^{[n]} have the same cardinality. These give "symmetric versions" of well-known results on the purity of usual strongly, weakly and chord separated collections of subsets of [n][n], and in the case of weak separation, this extends a recent result due to Karpman on the purity of symmetric weakly separated collections in ([n]n/2)\binom{[n]}{n/2} for nn even.

Keywords

Cite

@article{arxiv.2007.02011,
  title  = {The purity phenomenon for symmetric separated set-systems},
  author = {Vladimir Danilov and Alexander Karzanov and Gleb Koshevoy},
  journal= {arXiv preprint arXiv:2007.02011},
  year   = {2022}
}

Comments

29 pages, 12 figures. This is an improved version. Also new results are added in the ends of Sects. 5 and 6

R2 v1 2026-06-23T16:50:49.336Z