Factoriality inside Boolean lattices
Abstract
Given a join semilattice S with a minimum 0, the quarks (also called atoms in order theory) are the elements that cover 0, and for each x ∈ S \0\ a factorization (into quarks) of x is a minimal set of quarks whose join is x. If every element x ∈ S \0\ has a factorization, then S is called factorizable. If for each x ∈ S \0\, any two factorizations of x have equal (resp., distinct) size, then we say that S is half-factorial (resp., length-factorial). Let BN be the Boolean lattice consisting of all finite subsets of N under intersections and unions. Here we study factorizations into quarks in join subsemilattices of BN, 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.