2015/05/22 by Stéphane Dugowson, Dugowson, Stéphane
Computer Science · Mathematics · #Advanced Algebra and Logic #Category Theory (math.CT) #FOS: Mathematics #General Topology (math.GN) #Logic, Reasoning, and Knowledge #math.CT #math.GN #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1505.05996
in French
arxiv created 2015/05/22 · openalex publication_date 2015/05/22 · arxiv updated 2015/05/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The prime purpose of this paper is to define the connectivity structure , on a set E, of any multiple relation defined on a family of sets indexed by E, such a relation expressing compatibility between the states of different systems (thus a full compatibility indicates absence of any connection). We then demonstrate a "Brunn's theorem" for those multiple relations, that is the fact that every connectivity structure is the connectivity structure of such a relation.