English
Related papers

Related papers: Rigid cylindrical frameworks with two coincident p…

200 papers

Let $P$ be a set of points and $L$ a set of lines in the (extended) Euclidean plane, and $I \subseteq P\times L$, where $i =(p,l) \in I$ means that point $p$ and line $l$ are incident. The incidences can be interpreted as quadratic…

An important, if relatively less well known aspect of the singularity theorems in Lorentzian Geometry is to understand how their conclusions fare upon weakening or suppression of one or more of their hypotheses. Then, theorems with modified…

General Relativity and Quantum Cosmology · Physics 2014-08-20 I. P. Costa e Silva , J. L. Flores

We show that the usual fixed point for 3-d rigid string with topological term appears to be a trivial one, consisting of two decoupled conformal field theories. We further argue that by involving an additional term allowed by symmetries and…

High Energy Physics - Theory · Physics 2007-05-23 Weidong Zhao

In this article we explain the theory of rigid residue complexes in commutative algebra and algebraic geometry, summarizing the background, recent results and anticipated future results. Unlike all previous approaches to Grothendiec…

Algebraic Geometry · Mathematics 2021-02-02 Amnon Yekutieli

We investigate a novel setting for polytope rigidity, where a flex must preserve edge lengths and the planarity of faces, but is allowed to change the shapes of faces. For instance, the regular cube is flexible in this notion. We present…

Combinatorics · Mathematics 2026-03-11 Matthias Himmelmann , Bernd Schulze , Martin Winter

Here it is shown how to combine two generically globally rigid bar frameworks in $d$-space to get another generically globally rigid framework. The construction is to identify $d+1$ vertices from each of the frameworks and erase one of the…

Metric Geometry · Mathematics 2011-03-31 Robert Connelly

A bar-and-joint framework is a finite set of points together with specified distances between selected pairs. In rigidity theory we seek to understand when the remaining pairwise distances are also fixed. If there exists a pair of points…

Combinatorics · Mathematics 2013-08-16 Christopher Clement , Audrey Lee-St. John , Jessica Sidman

A foundational theorem of Laman provides a counting characterisation of the finite simple graphs whose generic bar-joint frameworks in two dimensions are infinitesimally rigid. Recently a Laman-type characterisation was obtained for…

Metric Geometry · Mathematics 2014-06-10 Anthony Nixon , John Owen , Stephen Power

A framework is a graph and a map from its vertices to R^d. A framework is called universally rigid if there is no other framework with the same graph and edge lengths in R^d' for any d'. A framework attachment is a framework constructed by…

Metric Geometry · Mathematics 2010-11-23 Kiril Ratmanski

In this paper we prove a recursive characterisation of generic rigidity for frameworks periodic with respect to a partially variable lattice. We follow the approach of modelling periodic frameworks as frameworks on a torus and use the…

Combinatorics · Mathematics 2012-04-09 Anthony Nixon , Elissa Ross

This article is concerned with the rigidity properties of geometric realizations of incidence geometries of rank two as points and lines in the Euclidean plane; we care about the distance being preserved among collinear points. We discuss…

Combinatorics · Mathematics 2022-04-28 Signe Lundqvist , Klara Stokes , Lars-Daniel Öhman

We study the fundamental algorithmic rigidity problems for generic frameworks periodic with respect to a fixed lattice or a finite-order rotation in the plane. For fixed-lattice frameworks we give an $O(n^2)$ algorithm for deciding generic…

Data Structures and Algorithms · Computer Science 2015-03-19 Matthew Berardi , Brent Heeringa , Justin Malestein , Louis Theran

We examine the generic local and global rigidity of various graphs in R^d. Bruce Hendrickson showed that some necessary conditions for generic global rigidity are (d+1)-connectedness and generic redundant rigidity and hypothesized that they…

Metric Geometry · Mathematics 2015-03-13 Samuel Frank , Jiayang Jiang

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…

Combinatorics · Mathematics 2023-12-20 Anthony Nixon , Bernd Schulze , Joseph Wall

In this paper, we study geometric rigidity of Riemannian manifolds admitting stable solutions of certain elliptic problems (stability in a variational sense), that is, under suitable hypotheses, we are able to characterize the Riemannian…

Differential Geometry · Mathematics 2018-02-13 Marcio Batista , Jose I. Santos

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…

Combinatorics · Mathematics 2024-10-11 Alison La Porta , Bernd Schulze

We show that universal rigidity of a generic bar and joint framework (G,p) in the line depends on more than the ordering of the vertices. In particular, we construct examples of one-dimensional generic frameworks with the same graph and…

Combinatorics · Mathematics 2021-04-06 Bryan Chen , Robert Connelly , Anthony Nixon , Louis Theran

A framework is a graph and a map from its vertices to E^d (for some d). A framework is universally rigid if any framework in any dimension with the same graph and edge lengths is a Euclidean image of it. We show that a generic universally…

Metric Geometry · Mathematics 2014-06-17 Steven J. Gortler , Dylan P. Thurston

In this article we investigate rigidity properties of integrable area-preserving twist maps of the cylinder. More specifically, we prove that if a deformation of the standard integrable map preserves rotational invariant circles (i.e.,…

Dynamical Systems · Mathematics 2022-02-04 Jessica Elisa Massetti , Alfonso Sorrentino

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