Related papers: A Primer on Chainmails: Structures for Point-free …
We develop the theory of arrangements of spheres. Consider a finite collection of codimension-$1$ subspheres in a positive-dimensional sphere. There are two posets associated with this collection: the poset of faces and the poset of…
A method for embedding graphs in Euclidean space is suggested. The method connects nodes to their geographically closest neighbors and economizes on the total physical length of links. The topological and geometrical properties of…
We give geometric characterisations of patch and Lawson topologies in the context of predicative point-free topology using the constructive notion of located subset. We present the patch topology of a stably locally compact formal topology…
A free Steiner quasigroup is a free object in the variety of Steiner quasigroups. Free Steiner quasigroups are characterised by the existence of a levelled construction that starts with a free base - that is, a set of elements none of which…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
Using each node's degree as a proxy for its importance, the topological hierarchy of a complex network is introduced and quantified. We propose a simple dynamical process used to construct networks which are either maximally or minimally…
We propose a unified mathematical framework for classifying phases of matter. The framework is based on different types of combinatorial structures with a notion of locality called lattices. A tensor lattice is a local prescription that…
We study partition of networks into basins of attraction based on a steepest ascent search for the node of highest degree. Each node is associated with, or "attracted" to its neighbor of maximal degree, as long as the degree is increasing.…
Topological holography is a conjectured correspondence between the symmetry charges and defects of a $D$-dimensional system with the anyons in a $(D+1)$-dimensional topological order: the symmetry topological field theory (SymTFT).…
We consider atoms interacting each other through the topological structure of a complex network and investigate lattice vibrations of the system, the quanta of which we call {\em netons} for convenience. The density of neton levels,…
We present a novel approach for data set scaling based on scale-measures from formal concept analysis, i.e., continuous maps between closure systems, and derive a canonical representation. Moreover, we prove said scale-measures are lattice…
Networks of rigid bars connected by joints, termed linkages, provide a minimal framework to design robotic arms and mechanical metamaterials built out of folding components. Here, we investigate a chain-like linkage that, according to…
A chain poset, by definition, consists of chains of ordered elements in a poset. We study the chain posets associated to two posets: the Boolean algebra and the poset of isotropic flags. We prove that, in both cases, the chain posets…
A specialization semilattice is a structure which can be embedded into $(\mathcal P(X), \cup, \sqsubseteq )$, where $X$ is a topological space, $ x \sqsubseteq y$ means $x \subseteq Ky$, for $x,y \subseteq X$, and $K$ is closure in $X$.…
In this thesis we propose and study a theory of ordered locales, a type of point-free space equipped with a preorder structure on its frame of opens. It is proved that the Stone-type duality between topological spaces and locales lifts to a…
Wireless networks are present everywhere but their management can be tricky since their coverage may contain holes even if the network is fully connected. In this paper we propose an algorithm that can build a communication tree between…
Contact algebra is one of the main tools in region-based theory of space. In \cite{dmvw1, dmvw2,iv,i1} it is generalized by dropping the operation Boolean complement. Furthermore we can generalize contact algebra by dropping also the…
A poset is (3+1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets play a central role in the (3+1)-free conjecture of Stanley and Stembridge. Lewis and Zhang have enumerated…
We propose a protocol to demonstrate the topological order of a spin-1/2 lattice model with four-body interactions. Unlike other proposals, it does not rely on the controlled movement of quasiparticles, thus eliminating the addressing,…
Network or graph structures are ubiquitous in the study of complex systems. Often, we are interested in complexity trends of these system as it evolves under some dynamic. An example might be looking at the complexity of a food web as…