Related papers: Infinitesimal rigidity in normed planes

Some aspects of a mathematical theory of rigidity and flexibility are developed for general infinite frameworks and two main results are obtained. In the first sufficient conditions, of a uniform local nature, are obtained for the existence…

We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…

We prove the rigidity of isotropic harmonic maps from a 2-torus to a complex projective space, when they are constructed from holomorphic embeddings associated to complete linear systems. We also prove that this rigidity holds for any…

In this paper we consider the inverse problem of determining a rigid inclusion inside a thin plate by applying a couple field at the boundary and by measuring the induced transversal displacement and its normal derivative at the boundary of…

We prove rigidity results describing contextually-constrained maps defined on Grassmannians and manifolds of ordered independent line tuples in finite-dimensional vector or Hilbert spaces. One statement in the spirit of the Fundamental…

A graph is \textit{rigid} if it only admits the identity endomorphism. We show that for every $d\ge 3$ there exist infinitely many mutually rigid $d$-regular graphs of arbitrary odd girth $g\geq 7$. Moreover, we determine the minimum order…

We prove that any properly oriented $C^{2,1}$ isometric immersion of a positively curved Riemannian surface M into Euclidean 3-space is uniquely determined, up to a rigid motion, by its values on any curve segment in M. A generalization of…

This paper introduces new invariants of rigid vertex graph embeddings by using non-local combinatorial information that is available at each graphical node. The new non-local information that we use in this paper involves parity in the…

Whitney's theorem states that every 3-connected planar graph is uniquely embeddable on the sphere. On the other hand, it has many inequivalent embeddings on another surface. We shall characterize structures of a $3$-connected $3$-regular…

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…

In this paper, several nonlinear elliptic systems are investigated on graphs. One type of the sobolev embedding theorem and a new version of the strong maximum principle are established. Then, by using the variational method, the existence…

We show that every orientable infinite-type surface is properly rigid as a consequence of a more general result. Namely, we prove that if a homotopy equivalence between any two non-compact orientable surfaces is a proper map, then it is…

We compute the twisted cohomology of the mapping class group with level structures, with coefficients in the $r$-tensor powers of the Prym representations for any positive integer $r$. When $r\ge 2$, we show that the cohomology exhibits…

For plane frameworks with reflection or rotational symmetries, where the group action is not necessarily free on the vertex set, we introduce a phase-symmetric orbit rigidity matrix for each irreducible representation of the group. We then…

Two isomorphic graphs can have inequivalent spatial embeddings in 3-space. In this way, an isomorphism class of graphs contains many spatial graph types. A common way to measure the complexity of a spatial graph type is to count the minimum…

A digraph is 2-regular if every vertex has both indegree and outdegree two. We define an embedding of a 2-regular digraph to be a 2-cell embedding of the underlying graph in a closed surface with the added property that for every…

A uniformly discrete Euclidean graph is a graph embedded in a Euclidean space so that there is a minimum distance between distinct vertices. If such a graph embedded in an $n$-dimensional space is preserved under $n$ linearly independent…

The random graph is an infinite graph with the universal property that any embedding of $G-v$ extends to an embedding of $G$, for any finite graph. In this paper we show that this graph embeds in the curve graph of a surface $\Sigma$ if and…

In a book embedding of a graph G, the vertices of G are placed in order along a straight-line called spine of the book, and the edges of G are drawn on a set of half-planes, called the pages of the book, such that two edges drawn on a page…

We prove that if a framework of a graph is neighborhood affine rigid in $d$-dimensions (or has the stronger property of having an equilibrium stress matrix of rank $n-d-1$) then it has an affine flex (an affine, but non Euclidean, transform…