Related papers: Axiomatic Theory of Betweenness
We study spaces of realisations of linkages (weighted graphs) whose underlying graph is a series parallel graph. In particular, we describe an algorithm for determining whether or not such spaces are connected.
A $biased\ graph$ is a pair $(G,\mathcal{B})$, where $G$ is a graph and $\mathcal{B}$ is a collection of `balanced' circuits of $G$ such that no $\Theta$-subgraph of $G$ contains precisely two balanced circuits. We prove a Ramsey-type…
Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…
This paper defines a new pseudometric for binary relations between finite sets that measures consensus among subsets. The main results are (1) a concise restatement of this pseudometric with an intuitively appealing interpretation via a…
This work focuses on the bearing rigidity theory, namely the branch of knowledge investigating the structural properties necessary for multi-element systems to preserve the inter-units bearings when exposed to deformations. The original…
Quantum theory is indeterministic, but not completely so. When a system is in a pure state there are properties it possesses with certainty, known as actual properties. The actual properties of a quantum system (in a pure state) fully…
Network theory provides various tools for investigating the structural or functional topology of many complex systems found in nature, technology and society. Nevertheless, it has recently been realised that a considerable number of systems…
The betweenness centrality of a vertex v is an important centrality measure that quantifies how many optimal paths between pairs of other vertices visit v. Computing betweenness centrality in a temporal graph, in which the edge set may…
This thesis is about conceptual aspects of gauge theories. Gauge theories lie at the heart of modern physics: in particular, they constitute the standard model of particle physics. At its simplest, the idea of gauge is that nature is best…
General Equilibrium Theory is the benchmark of economics, especially its results concerning the efficient allocation of resources, known as the First and Second Welfare Theorems. Yet, General Equilibrium Theory is beyond the scope of most…
The Ramsey's theorem says that a graph with sufficiently many vertices contains a clique or stable set with many vertices. Now we attach some parameter to every vertex, such as degree. Consider the case a graph with sufficiently many…
We clarified the connection between measurements and partitions, and discussed the meaning of semiotics for measurements based on functions. The terms of property and relation quantity were defined by our understanding of partitions and…
A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the…
For suitable subgroups of a finitely generated group, we define the intersection number of one subgroup with another subgroup and show that this number is symmetric. We also give an interpretation of this number.
Convergence theory is an extension of general topology. In contrast with topology, it is closed under some important operations, like exponentiation. With all its advantages, convergence theory remains rather unknown. It is an aim of this…
This work is devoted to the study of the relationships between graph theory and the qualitative analysis of ordinary differential equations, with a special focus on two-dimensional systems. In particular, we reinterpret classical results…
Coordination sequences of periodic and quasiperiodic graphs are analysed. These count the number of points that can be reached from a given point of the graph by a number of steps along its bonds, thus generalising the familiar coordination…
Relational structures are emerging as ubiquitous mathematical machinery in the semantics of open systems of various kinds. Cartesian bicategories are a well-known categorical algebra of relations that has proved especially useful in recent…
There are typically several nonisomorphic graphs having a given degree sequence, and for any two degree sequence terms it is often possible to find a realization in which the corresponding vertices are adjacent and one in which they are…
The goal of this paper is to present a centrality measurement for the nodes of a hypergraph, by using existing literature which extends eigenvector centrality from a graph to a hypergraph, and literature which give a general centrality…