English

Two properties of maximal antichains in strict chain product posets

Combinatorics 2021-01-19 v2

Abstract

We present two results on maximal antichains in the strict chain product poset [t1+1]×[t2+1]××[tn+1][t_1+1]\times[t_2+1]\times\ldots\times[t_n+1]. First, we prove that these maximal antichains are also maximum. Second, we prove that there is a bijection between maximal antichains in the strict chain product poset [t1+1]×[t2+1]××[tn+1][t_1+1]\times[t_2+1]\times\ldots\times[t_n+1] and antichains in the non-strict chain product poset [t1]×[t2]××[tn][t_1]\times[t_2]\times\ldots\times[t_n].

Keywords

Cite

@article{arxiv.1701.06750,
  title  = {Two properties of maximal antichains in strict chain product posets},
  author = {Shen-Fu Tsai},
  journal= {arXiv preprint arXiv:1701.06750},
  year   = {2021}
}