2000 character limit reached
Connectivity structure of multiple relations
Published 22 May 2015 in math.GN and math.CT | (1505.05996v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.