Related papers: Generic Rigidity of Graph Frameworks in Euclidean …
We establish a gluing theorem for linearised vacuum gravitational fields in Bondi gauge on a class of characteristic surfaces in static vacuum four-dimensional backgrounds with cosmological constant $\Lambda \in \mathbb{R}$ and arbitrary…
We prove a generalization of Gromov's conjecture on scalar curvature rigidity of convex polytopes to arbitrary convex Riemannian polytope type domains via harmonic spinors on convex domians with boundary condition constructed by Brendle. In…
All global solutions of arbitrary topology of the most general 1+1 dimensional dilaton gravity models are obtained. We show that for a generic model there are globally smooth solutions on any non-compact 2-surface. The solution space is…
We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…
The complexity of the graph isomorphism problem for trapezoid graphs has been open over a decade. This paper shows that the problem is GI-complete. More precisely, we show that the graph isomorphism problem is GI-complete for comparability…
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$…
In this paper we formulate and prove necessary and sufficient geometric conditions for existence of generic tensegrities in the plane for arbitrary graphs. The conditions are written in terms of "meet-join" relations for the configuration…
One goal of geometric measure theory is to understand how measures in the plane or higher dimensional Euclidean space interact with families of lower dimensional sets. An important dichotomy arises between the class of rectifiable measures,…
We establish existence and regularity results for boundary value problems arising from the first variation of the Willmore energy in the graphical setting. Our focus lies on two-dimensional surfaces with fixed clamped boundary conditions,…
In this paper, we introduce a natural classification of bar and joint frameworks that possess symmetry. This classification establishes the mathematical foundation for extending a variety of results in rigidity, as well as infinitesimal or…
In 1975 Erd\H{o}s initiated the study of the following very natural question. What can be said about the chromatic number of unit distance graphs in $\mathbb{R}^2$ that have large girth? Over the years this question and its natural…
We study the maximum dimension $d=d(n,p)$ for which an Erd\H{o}s-R\'enyi $G(n,p)$ random graph is $d$-rigid. Our main results reveal two different regimes of rigidity in $G(n,p)$ separated at $p_c=C_*\log n/n,~C_*=2/(1-\log 2)$ -- the point…
We study the rigidity properties of Grassmannian frames: basis-like sets of unit vectors that correspond to optimal Grassmannian line packings. It is known that Grassmannian frames characterized by the Welch bound must satisfy the…
The $d$-dimensional algebraic connectivity $a_d(G)$ of a graph $G=(V,E)$, introduced by Jord\'an and Tanigawa, is a quantitative measure of the $d$-dimensional rigidity of $G$ that is defined in terms of the eigenvalues of stiffness…
It is a famous result of Lovasz and Yemini (1982) that 6-connected graphs are rigid in the plane. This was recently improved by Jackson and Jordan (2009) who showed that 6-mixed connectivity is also sufficient for rigidity. Here we give…
For a bar-joint framework $(G,p)$, a subgroup $\Gamma$ of the automorphism group of $G$, and a subgroup of the orthogonal group isomorphic to $\Gamma$, we introduce a symmetric averaging map which produces a bar-joint framework on $G$ with…
We define periodic frameworks as graphs on the torus, using the language of gain graphs. We present some fundamental definitions and results about the infinitesimal rigidity of graphs on a torus of fixed size and shape, and find necessary…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…
Given a graph $G$, a cost function on the non-edges of $G$, and an integer $d$, the problem of finding a cheapest globally rigid supergraph of $G$ in $\mathbb{R}^d$ is NP-hard for $d\geq 1$. For this problem, which is a common…
In the context of generalised geometry we investigate reductions to $SU(m)\times SU(m)$ together with an integrability condition which in dimension 6 describes the geometry of type II supergravity compactifications.