Related papers: The combinatorial geometry of stresses in framewor…
If $G$ is a graph with vertex set $V$, let Conf$_n^{\text{sink}}(G,V)$ be the space of $n$-tuples of points on $G$, which are only allowed to overlap on elements of $V$. We think of Conf$_n^{\text{sink}}(G,V)$ as a configuration space of…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two distinct types: 'space barriers' from convex…
We describe a new way to construct finite geometric objects. For every k we obtain a symmetric configuration E(k-1) with k points on a line. In particular, we have a constructive existence proof for such configurations. The method is very…
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
I present the junction conditions for F(R) theories of gravity and their implications: the generalized Israel conditions and equations. These junction conditions are necessary to construct global models of stars, galaxies, etc., where a…
A $d$-dimensional (bar-and-joint) framework $(G,p)$ consists of a graph $G=(V,E)$ and a realisation $p:V\to \mathbb{R}^d$. It is rigid if every continuous motion of the vertices which preserves the lengths of the edges is induced by an…
In this paper, we obtain a sufficient condition for the existence of parity factors in a regular graph in terms of edge-connectivity. Moreover, we also show that our condition is sharp.
In structural rigidity, one studies frameworks of bars and joints in Euclidean space. Such a framework is an articulated structure consisting of rigid bars, joined together at joints around which the bars may rotate. In this paper, we will…
Let $L$ be a sequence $(\ell_1,\ell_2,\ldots,\ell_n)$ of $n$ lines in $\mathbb{C}^3$. We define the {\it intersection graph} $G_L=([n],E)$ of $L$, where $[n]:=\{1,\ldots, n\}$, and with $\{i,j\}\in E$ if and only if $i\neq j$ and the…
A (bar-and-joint) framework is a set of points in a normed space with a set of fixed distance constraints between them. Determining whether a framework is locally rigid - i.e. whether every other suitably close framework with the same…
The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed…
In this paper, we study the existence of fixed points for mappings defined on complete (compact) metric space (X, d) satisfying a general contractive (contraction) inequality depended on another function. These conditions are analogous to…
Shape grammars compute over shapes which are defined in the universe $U^*$. Shapes in the universe $U^*$ are analogous to line drawings that can be physically realized in the plane. Any shape is embedded or contained in an arrangement of…
We describe how geometrical methods can be applied to a system with explicitly time-dependent second-class constraints so as to cast it in Hamiltonian form on its physical phase space. Examples of particular interest are systems which…
In this paper we establish the existence of related fixed points theorems for two pairs of mappings with different contraction conditions in two fuzzy metric spaces.
We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that one admits faithful realizations and the other has only…
A $d$-dimensional tensegrity framework $(T,p)$ is an edge-labeled geometric graph in ${\mathbb R}^d$, which consists of a graph $T=(V,B\cup C\cup S)$ and a map $p:V\to {\mathbb R}^d$. The labels determine whether an edge $uv$ of $T$…
We introduce a general decomposition of the stress tensor for incompressible fluids in terms of its components on a tensorial basis adapted to the local flow conditions, which include extensional flows, simple shear flows, and any type of…
This paper explores the properties of directed graphs, termed generalized action graphs, which exhibit a strong connection to certain number sequences. Focusing on the structural and combinatorial aspects, we investigate the conditions…