English
Related papers

Related papers: Generic Global Rigidity in Complex and Pseudo-Eucl…

200 papers

We describe a very simple condition that is necessary for the universal rigidity of a complete bipartite framework $(K(n,m),p,q)$. This condition is also sufficient for universal rigidity under a variety of weak assumptions, such as general…

Metric Geometry · Mathematics 2016-10-14 Robert Connelly , Steven J. Gortler

A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in $\mathbb{R}^d$ that admit some non-trivial symmetry. When $d=2$ there is a large literature on this…

Combinatorics · Mathematics 2025-09-30 Sean Dewar , Georg Grasegger , Eleftherios Kastis , Anthony Nixon

A graph is called $d$-rigid if there exists a generic embedding of its vertex set into $\mathbb{R}^d$ such that every continuous motion of the vertices that preserves the lengths of all edges actually preserves the distances between all…

Combinatorics · Mathematics 2023-12-13 Michael Krivelevich , Alan Lew , Peleg Michaeli

Let $\mathbf{p}$ be a configuration of $n$ points in $\mathbb{R}^d$ for some $n$ and some $d \ge 2$. Each pair of points has a Euclidean length in the configuration. Given some graph $G$ on $n$ vertices, we measure the point-pair lengths…

Metric Geometry · Mathematics 2019-12-04 Steven J. Gortler , Louis Theran , Dylan P. Thurston

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

Combinatorics · Mathematics 2024-08-28 Joannes Vermant , Klara Stokes

In this paper we study the kaleidoscopic pseudo-randomness of finite Euclidean graphs using probabilistic methods. Roughly speaking, we show that sufficiently large subsets of d-dimensional vector spaces over finite fields contain every…

Combinatorics · Mathematics 2008-08-03 Le Anh Vinh

In this note we prove a global rigidity result for asymptotically flat, scalar flat Euclidean hypersurfaces with a minimal horizon lying in a hyperplane, under a natural ellipticity condition. As a consequence we obtain, in the context of…

Differential Geometry · Mathematics 2021-07-30 Levi Lopes de Lima , Frederico Girão

In this paper, our purpose is to study rigidity theorems for $\lambda$-hypersurfaces in Euclidean space under Gauss map. As a Bernstein type problem for $\lambda$-hypersurfaces, we prove that an entirely graphic $\lambda$-hypersurface in…

Differential Geometry · Mathematics 2014-10-21 Qing-Ming Cheng , Guoxin Wei

We define a new category of non-archimedean analytic spaces over a complete discretely valued field, which we call uniformly rigid. It extends the category of rigid spaces, and it can be described in terms of bounded functions on products…

Algebraic Geometry · Mathematics 2011-03-30 Christian Kappen

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

In "Universal rigidity on the line, point orde" it is shown, answering a question of Jord\'an and Nguyen, that universal rigidity of a generic bar-joint framework in R^1 depends on more than the ordering of the vertices. The graph G that…

Metric Geometry · Mathematics 2022-07-19 Bryan Chen , Robert Connelly , Steven J. Gortler , Anthony Nixon , Louis Theran

It is proved that vertical graphs and radial graphs are strongly stable for a certain type of densities in Euclidean space ${\mathbb R}^{n+1}$. Particular cases of these densities include translators, expanders and singular minimal…

Differential Geometry · Mathematics 2025-05-05 Rafael López

A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, every edge-length preserving continuous motion of the vertices preserves the distances between all pairs of non-adjacent vertices as well.…

Combinatorics · Mathematics 2026-03-02 Michael Krivelevich , Alan Lew , Peleg Michaeli

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…

Combinatorics · Mathematics 2016-11-09 Gregory McColm

We develop, in the context of general relativity, the notion of a geoid -- a surface of constant "gravitational potential". In particular, we show how this idea naturally emerges as a specific choice of a previously proposed, more general…

General Relativity and Quantum Cosmology · Physics 2016-06-10 Marius Oltean , Richard J. Epp , Paul L. McGrath , Robert B. Mann

Recent research has shown that alignment between the structure of graph data and the geometry of an embedding space is crucial for learning high-quality representations of the data. The uniform geometry of Euclidean and hyperbolic spaces…

Machine Learning · Computer Science 2023-06-27 Wei Zhao , Federico Lopez , J. Maxwell Riestenberg , Michael Strube , Diaaeldin Taha , Steve Trettel

We characterise rigid graphs for cylindrical normed spaces $Z=X\oplus_\infty \mathbb{R}$ where $X$ is a finite dimensional real normed linear space and $Z$ is endowed with the product norm. In particular, we obtain purely combinatorial…

Metric Geometry · Mathematics 2023-05-16 Sean Dewar , Derek Kitson

We study the generic volume rigidity of $(d-1)$-dimensional simplicial complexes in $\mathbb R^{d-1}$, and show that the volume rigidity of a complex can be identified in terms of its exterior shifting. In addition, we establish the volume…

Combinatorics · Mathematics 2023-05-10 Denys Bulavka , Eran Nevo , Yuval Peled

Let $G$ be a graph on $n$ nodes. In this note, we prove that if $G$ is $(r+1)$-vertex connected, $1 \leq r \leq n-2$, then there exists a configuration $p$ in general position in $R^r$ such that the bar framework $(G,p)$ is universally…

Metric Geometry · Mathematics 2014-08-18 A. Y. Alfakih