Hypercontact semilattices
Abstract
Contact Boolean algebras are one of the main algebraic tools in region-based theory of space. T. Ivanova provided strong motivations for the study of merely semilattices with a contact relation. Another significant motivation for considering an even weaker underlying structure comes from event structures with binary conflict in the theory of concurrent systems in computer science. All the above-hinted notions deal with a binary contact relation. Several authors suggested the more general study of -ary ``hypercontact'' relations and noticed that, in general, a hypercontact relation cannot be retrieved from just a binary contact relation. A similar evolution occurred in the study of the just mentioned event structures in computer science. In an effort to unify the above lines of research, in this paper we study join semilattices with a hypercontact relation. We provide representation theorems into Boolean algebras, with or without overlap hypercontact relation. With a single exception, our proofs are choice-free. We also present several examples and problems; in particular, we briefly discuss some connections with event structures and hypergraphs.
Cite
@article{arxiv.2308.04874,
title = {Hypercontact semilattices},
author = {Paolo Lipparini},
journal= {arXiv preprint arXiv:2308.04874},
year = {2026}
}
Comments
v5 added material and corrected a wrong statement (only the appendix has been modified) v4 Added an appendix (not present in the journal version) using graph theoretical results in order to characterize binary relations representable by proximities. v3 The name of the main notion has been changed to "hypercontact'' in order to keep the terminology uniform with the literature