Factoriality inside Boolean lattices

MaRDI QIDQ6434796zbMATH OpenFDO

Authors Felix Gotti

Publication date 30 April 2023

Mathematics Subject Classification ID

Applications of graph theory (05C90) Free lattices, projective lattices, word problems (06B25) Factorization (11Y05) Arithmetic theory of semigroups (20M13)

Abstract: Given a join semilattice $S$ with a minimum $hat0$, the quarks (also called atoms in order theory) are the elements that cover $hat0$, and for each $xinSsetminushat0$ a factorization (into quarks) of $x$ is a minimal set of quarks whose join is $x$. If every element $xinSsetminushat0$ has a factorization, then $S$ is called factorizable. If for each $xinSsetminushat0$, any two factorizations of $x$ have equal (resp., distinct) size, then we say that $S$ is half-factorial (resp., length-factorial). Let $B_{m}athbbN$ be the Boolean lattice consisting of all finite subsets of $mathbbN$ under intersections and unions. Here we study factorizations into quarks in join subsemilattices of $B_{m}athbbN$, 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.

This page was built for publication: Factoriality inside Boolean lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6434796)