English
Related papers

Related papers: Rigidity with few locations

200 papers

While the problem of determining whether an embedding of a graph $G$ in $\mathbb{R}^2$ is {\it infinitesimally rigid} is well understood, specifying whether a given embedding of $G$ is {\it rigid} or not is still a hard task that usually…

Combinatorics · Mathematics 2019-01-31 Orit E. Raz , József Solymosi

A simple graph G=(V,E) is 3-rigid if its generic bar-joint frameworks in R3 are infinitesimally rigid. Block and hole graphs are derived from triangulated spheres by the removal of edges and the addition of minimally rigid subgraphs, known…

Combinatorics · Mathematics 2015-07-10 James Cruickshank , Derek Kitson , Stephen Power

We prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…

Combinatorics · Mathematics 2020-01-15 James Davies , Carsten Thomassen

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…

Metric Geometry · Mathematics 2010-07-07 Wendy Finbow-Singh , Walter Whiteley

A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and…

Metric Geometry · Mathematics 2013-10-08 D. Kitson , S. C. Power

We prove that if $G$ is the graph of a connected triangulated $(d-1)$-manifold, for $d\geq 3$, then $G$ is generically globally rigid in $\mathbb R^d$ if and only if it is $(d+1)$-connected and, if $d=3$, $G$ is not planar. The special case…

Combinatorics · Mathematics 2024-09-26 James Cruickshank , Bill Jackson , Shin-ichi Tanigawa

We show that in Cartan-Hadamard manifolds $M^n$, $n\geq 3$, closed infinitesimally convex hypersurfaces $\Gamma$ bound convex flat regions, if curvature of $M^n$ vanishes on tangent planes of $\Gamma$. This encompasses…

Differential Geometry · Mathematics 2025-10-16 Mohammad Ghomi

We prove that for any prime homology $(d-1)$-sphere $\Delta$ of dimension $d-1\geq 3$ and any edge $e\in S$, the graph $G(\Delta)-e$ is generically $d$-rigid. This confirms a conjecture of Nevo and Novinsky.

Combinatorics · Mathematics 2017-04-13 Hailun Zheng

We explore the rigidity of generic frameworks in 3-dimensions whose underlying graph is close to being planar. Specifically we consider apex graphs, edge-apex graphs and their variants and prove independence results in the generic…

Combinatorics · Mathematics 2024-02-28 Sean Dewar , Georg Grasegger , Eleftherios Kastis , Anthony Nixon , Brigitte Servatius

We present three results which support the conjecture that a graph is minimally rigid in $d$-dimensional $\ell_p$-space, where $p\in (1,\infty)$ and $p\not=2$, if and only if it is $(d,d)$-tight. Firstly, we introduce a graph bracing…

Metric Geometry · Mathematics 2024-01-29 Sean Dewar , Derek Kitson , Anthony Nixon

In this paper we study the property of generic global rigidity for frameworks of graphs embedded in d-dimensional complex space and in a d-dimensional pseudo-Euclidean space ($R^d$ with a metric of indefinite signature). We show that a…

Metric Geometry · Mathematics 2017-08-29 Steven J. Gortler , Dylan P. Thurston

A simple graph is $3$-rigid if its generic bar-joint frameworks in $R^3$ are infinitesimally rigid. Necessary and sufficient conditions are obtained for the minimal $3$-rigidity of a simple graph which is obtained from the $1$-skeleton of a…

Combinatorics · Mathematics 2015-09-03 James Cruickshank , Derek Kitson , Stephen Power

We prove a topological rigidity theorem for closed hypersurfaces of the Euclidean sphere and of an elliptic space form. It asserts that, under a lower bound hypothesis on the absolute value of the principal curvatures, the hypersurface is…

Differential Geometry · Mathematics 2018-09-28 Eduardo Longa , Jaime Ripoll

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.…

Combinatorics · Mathematics 2021-10-26 Evangelos Bartzos , Ioannis Z. Emiris , Raimundas Vidunas

We generalize Cauchy's celebrated theorem on the global rigidity of convex polyhedra in Euclidean $3$-space $\mathbb{E}^{3}$ to the context of circle polyhedra in the $2$-sphere $\mathbb{S}^{2}$. We prove that any two convex and proper…

Metric Geometry · Mathematics 2017-06-05 John C. Bowers , Philip L. Bowers , Kevin Pratt

Tanigawa (2016) showed that vertex-redundant rigidity of a graph implies its global rigidity in arbitrary dimension. We extend this result to periodic graphs under fixed lattice representations. A periodic graph is vertex-redundantly rigid…

Metric Geometry · Mathematics 2018-04-24 Viktoria E. Kaszanitzky , Csaba Kiraly , Bernd Schulze

The triangulations of a surface $\Sigma$ with a prescribed set of vertices can be endowed with a graph structure $\mathcal{F}(\Sigma)$. Its edges connect two triangulations that differ by a single arc. It is known that, when $\Sigma$ is a…

Geometric Topology · Mathematics 2021-09-14 Lionel Pournin , Zili Wang

This paper is the second in a series where we attempt to give a complete description of the space of all embedded minimal surfaces of fixed genus in a fixed (but arbitrary) closed 3-manifold. The key for understanding such surfaces is to…

Analysis of PDEs · Mathematics 2007-05-23 Tobias H. Colding , William P. Minicozzi

A subcomplex $\mathcal{X}$ of a cell complex $\mathcal{C}$ is called \emph{rigid} with respect to another cell complex $\mathcal{C}'$ if every injective simplicial map $\lambda:\mathcal{X} \rightarrow \mathcal{C}'$ has a unique extension to…

Geometric Topology · Mathematics 2025-02-14 Chandrika Sadanand , Emily Shinkle

Every noncompact surface is shown to have a (3,6)-tight triangulation, and applications are given to the generic rigidity of countable bar-joint frameworks in R^3. In particular, every noncompact surface has a (3,6)-tight triangulation that…

Combinatorics · Mathematics 2025-04-08 Stephen C. Power
‹ Prev 1 2 3 10 Next ›