Related papers: Epsilon local rigidity and numerical algebraic geo…
Local existence and well posedness for a class of solutions for the Euler Poisson system is shown. These solutions have a density $\rho$ which either falls off at infinity or has compact support. The solutions have finite mass, finite…
We study local rigidity properties of holomorphic embeddings of real hypersurfaces in $\mathbb C^2$ into real hypersurfaces in $\mathbb C^3$ and show that infinitesimal conditions imply actual local rigidity in a number of (important)…
Paradigmatic model systems, which are used to study the mechanical response of matter, are random networks of point-atoms, random sphere packings, or simple crystal lattices, all of these models assume central-force interactions between…
The concept of local symmetry is a powerful tool in predicting complex transport phenomena in aperiodic media. A nonlocal continuity formalism reveals how local symmetries are encoded into the dynamics of light propagation in discrete…
A bar-joint framework $(G,p)$ in a (non-Euclidean) real normed plane $X$ is the combination of a finite, simple graph $G$ and a placement $p$ of the vertices in $X$. A framework $(G,p)$ is globally rigid in $X$ if every other framework…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
We discuss various aspects of a local-to-global embedding technique and the metric geometry of stable metric spaces and of two of its important subclasses: locally finite spaces and proper spaces. We explain how the barycentric gluing…
Given a finite Lie incidence geometry which is either a polar space of rank at least $3$ or a strong parapolar space of symplectic rank at least $4$ and diameter at most $4$, or the parapolar space arising from the line Grassmannian of a…
We investigate how to find generic and globally rigid realizations of graphs in $\mathbb{R}^d$ based on elementary geometric observations. Our arguments lead to new proofs of a combinatorial characterization of the global rigidity of graphs…
We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection. To establish these results we develop a…
In this paper we establish combinatorial characterisations of symmetry-generic infinitesimally rigid frameworks in the Euclidean plane for rotational groups of order 4 and 6, and of odd order between 5 and 1000, where a joint may lie at the…
A bar-joint framework $(G,p)$ is the combination of a graph $G$ and a map $p$ assigning positions, in some space, to the vertices of $G$. The framework is rigid if every edge-length-preserving continuous motion of the vertices arises from…
We consider the global rigidity problem for bar-joint frameworks where each vertex is constrained to lie on a particular line in $\mathbb R^d$. In our setting we allow multiple vertices to be constrained to the same line. Under a mild…
Robustness is a standard correctness property which intuitively means that if the input to the program changes less than a fixed small amount then the output changes only slightly. This notion is useful in the analysis of rounding error for…
A bar-joint framework $(G,p)$ is the combination of a finite simple graph $G=(V,E)$ and a placement $p:V\rightarrow \mathbb{R}^d$. The framework is rigid if the only edge-length preserving continuous motions of the vertices arise from…
The energy-based definition provides a viable resolution to the longstanding confusion on the proper definition of $n$-th order rigidity and flexibility in geometric constraint systems. Applying an energy-based local rigidity analysis to…
In this paper, we initiate a systematic study of graph resilience. The (local) resilience of a graph G with respect to a property P measures how much one has to change G (locally) in order to destroy P. Estimating the resilience leads to…
Based on methods of structural convergence we provide a unifying view of local-global convergence, fitting to model theory and analysis. The general approach outlined here provides a possibility to extend the theory of local-global…
We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of math.CO/0307347 which treats the minimally generically rigid case. The proof…
We show that any graph that is generically globally rigid in $\mathbb{R}^d$ has a realization in $\mathbb{R}^d$ that is both generic and universally rigid. This also implies that the graph also must have a realization in $\mathbb{R}^d$ that…