English

Factoriality inside Boolean lattices

Combinatorics 2023-05-02 v1

Abstract

Given a join semilattice SS with a minimum 0^\hat{0}, the quarks (also called atoms in order theory) are the elements that cover 0^\hat{0}, and for each xS{0^}x \in S \setminus \{\hat{0}\} a factorization (into quarks) of xx is a minimal set of quarks whose join is xx. If every element xS{0^}x \in S \setminus \{\hat{0}\} has a factorization, then SS is called factorizable. If for each xS{0^}x \in S \setminus \{\hat{0}\}, any two factorizations of xx have equal (resp., distinct) size, then we say that SS is half-factorial (resp., length-factorial). Let BNB_\mathbb{N} be the Boolean lattice consisting of all finite subsets of N\mathbb{N} under intersections and unions. Here we study factorizations into quarks in join subsemilattices of BNB_\mathbb{N}, focused on the notions of half-factoriality and length-factoriality. We also consider the unique factorization property, which is the most special and relevant type of half-factoriality, and the elasticity, which is an arithmetic statistic that measures the deviation from half-factoriality.

Keywords

Cite

@article{arxiv.2305.00413,
  title  = {Factoriality inside Boolean lattices},
  author = {Khalid Ajran and Felix Gotti},
  journal= {arXiv preprint arXiv:2305.00413},
  year   = {2023}
}

Comments

22 pages, 4 figures

R2 v1 2026-06-28T10:21:49.254Z