Related papers: Global rigidity of 2-dimensional direction-length …

Let $\mathcal{P}$ be a set of $n=2m+1$ points in the plane in general position. We define the graph $GM_\mathcal{P}$ whose vertex set is the set of all plane matchings on $\mathcal{P}$ with exactly $m$ edges. Two vertices in…

We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…

A consistent path system in a graph $G$ is an collection of paths, with exactly one path between any two vertices in $G$. A path system is said to be consistent if it is intersection-closed. We say that $G$ is strictly metrizable if every…

Let $D$ be a connected oriented graph. A set $S \subseteq V(D)$ is convex in $D$ if, for every pair of vertices $x, y \in S$, the vertex set of every $xy$-geodesic, ($xy$ shortest directed path) and every $yx$-geodesic in $D$ is contained…

We provide a way of determining the infinitesimal rigidity of rod configurations realizing a rank two incidence geometry in the Euclidean plane. We model each rod with a cone over its point set and prove that the resulting geometric…

Global Navigation Satellite Systems (GNSS) are a widely used technology for positioning and navigation. GNSS positioning relies on pseudorange measurements from satellites to receivers. A pseudorange is the apparent distance between two…

In 2005, Bob Connelly showed that a generic framework in $\bR^d$ is globally rigid if it has a stress matrix of maximum possible rank, and that this sufficient condition for generic global rigidity is preserved by the 1-extension operation.…

For any metric $d$ on $\mathbb{R}^2$, an ($\mathbb{R}^2,d$)-geometric graph is a graph whose vertices are points in $\mathbb{R}^2$, and two vertices are adjacent if and only if their distance is at most 1. If $d=\|.\|_{\infty}$, the metric…

We study the boundary rigidity problem for compact Riemannian manifolds with boundary $(M,g)$: is the Riemannian metric $g$ uniquely determined, up to an action of diffeomorphism fixing the boundary, by the distance function $\rho_g(x,y)$…

In this note we prove a lower bound for the rank of 2-dimensional generic rigidity matroid for regular graphs of degree four and five. Also, we give examples to show the order of the bound we give is sharp.

Combinatorial characterisations are obtained of symmetric and anti-symmetric infinitesimal rigidity for two-dimensional frameworks with reflectional symmetry in the case of norms where the unit ball is a quadrilateral and where the…

Let $G$ be a strongly connected directed graph and $u,v,w\in V(G)$ be three vertices. Then $w$ strongly resolves $u$ to $v$ if there is a shortest $u$-$w$-path containing $v$ or a shortest $w$-$v$-path containing $u$. A set $R\subseteq…

Let $G$ be a finite group. The intersection graph of $G$ is a graph whose vertex set is the set of all proper non-trivial subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $H\cap K \neq \{e\}$, where $e$ is…

Motivated by the problem of constructing explicit geometric string structures, we give a rigid model for bundle 2-gerbes, and define connective structures thereon. This model is designed to make explicit calculations easier in applications…

Maps $f,g\colon I\to I$ are called strongly commuting if $f\circ g^{-1}=g^{-1}\circ f$. We show that strongly commuting, piecewise monotone maps $f,g$ can be decomposed into a finite number of invariant intervals (or period 2 intervals) on…

In this paper we consider the effect of symmetry on the rigidity of bar-joint frameworks, spherical frameworks and point-hyperplane frameworks in $\mathbb{R}^d$. In particular we show that, under forced or incidental symmetry, infinitesimal…

A fundamental theorem of Laman characterises when a bar-joint framework realised generically in the Euclidean plane admits a non-trivial continuous deformation of its vertices. This has recently been extended in two ways. Firstly to…

The unit distance graph $G_{\mathbb{R}^d}^1$ is the infinite graph whose nodes are points in $\mathbb{R}^d$, with an edge between two points if the Euclidean distance between these points is 1. The 2-dimensional version $G_{\mathbb{R}^2}^1$…

Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…

A longstanding problem in rigidity theory is to characterize the graphs which are minimally generically rigid in 3-space. The results of Cauchy, Dehn, and Alexandrov give one important class: the triangulated convex spheres, but there is an…