Related papers: A Primer on Chainmails: Structures for Point-free …
The definition of the complement of a fuzzy subset is algebraic in nature and when it is used in the context of fuzzy topological spaces it does not share any similarity with the usual property of topological spaces that the complement of…
Completions of metric spaces are usually constructed using Cauchy sequences. However, this does not work for general uniform spaces, where Cauchy filters or nets must be used instead. The situation in pointfree topology is more…
For a given partially ordered set (poset) and a given family of mappings of the poset into itself, we study the problem of the description of joint fixed points of this family. Well-known Tarski's theorem gives the structure of the set of…
The aim of this short note is to develop a (co)homology theory for topological spaces together with the specialisation preorder. A known way to construct such a (co)homology is to define a partial order on the topological space starting…
The network topology can be described by the number of nodes and the interconnections among them. The degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability…
Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed…
The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…
Subgraphs reveal information about the geometry and functionalities of complex networks. For scale-free networks with unbounded degree fluctuations, we obtain the asymptotics of the number of times a small connected graph occurs as a…
We present a one-to-one correspondence between equivalence classes of embeddings of a manifold (into a larger manifold of the same dimension) and equivalence classes of certain distances on the manifold. This correspondence allows us to use…
A linkage is a finite graph with lengths assigned to each edge. A planar realization is a map to the plane which preserves edge lengths. It can be thought of as a mechanical device formed from stiff rods and rotating joints. We look at the…
Let $G$ be an acylic directed graph. For each vertex $g \in G$, we define an involution on the independent sets of $G$. We call these involutions flips, and use them to define a new partial order on independent sets of $G$. Trim lattices…
We introduce an algebraic concept of the frame for abstract conditional independence (CI) models, together with basic operations with respect to which such a frame should be closed: copying and marginalization. Three standard examples of…
Let A, B, S be categories, let F:A-->S and G:B-->S be functors. We assume that for "many" objects a in A, there exists an object b in B such that F(a) is isomorphic to G(b). We establish a general framework under which it is possible to…
Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…
The theory of complex trees is introduced as a new approach to study a broad class of self-similar sets. Systems of equations encoded by complex trees tip-to-tip equivalence relations are used to obtain one-parameter families of connected…
We present the lattice structure of Feynman diagram renormalization in physical QFTs from the viewpoint of Dyson-Schwinger-Equations and the core Hopf algebra of Feynman diagrams. The lattice structure encapsules the nestedness of diagrams.…
The Bott index has become an indispensable tool to probe the topology of quantum matter, particularly in systems lacking translational symmetry. Constructed from a plaquette operator, it retains the phase information while discarding the…
Linear diagrams are used to visualize set systems by depicting set memberships as horizontal line segments in a matrix, where each set is represented as a row and each element as a column. Each such line segment of a set is shown in a…
Localic relations are relations internal to the category of locales, forming the point-free analogues of set-theoretic relations, and providing the general backdrop of localic order theory. This work studies 'open cone' localic relations,…
The simple cubic lattice defines a set of points at regular distances. The volume of the Voronoi cells around each point may serve as a weight for integration over the entire space. We add interstitial points to this grid according to the…