arXiv 2104.018922021-04-05math.COmath.AGmath.MG

Universal rigidity on the line, point order

Bryan Chen, Robert Connelly, Anthony Nixon, Louis Theran

备注：: 9 pages, 6 figures

英文摘要：

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 ordering of the vertices, such that one is universally rigid and one is not. This answers, in the negative, a question of Jordan and Nguyen.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Universal Rigidity of Ladders on the line

In "Universal rigidity on the line, point orde" it is shown, answering a question of Jordán 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 was used in that paper is a ladder with three rungs. Here we provide a general answer when that ladder with three rungs in the line is universally rigid and when it is not.

2022-07-18math.COmath.MG

Graph connectivity and universal rigidity of bar frameworks

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 rigid. The proof is constructive and is based on a theorem by Lovasz et al concerning orthogonal representations and connectivity of graphs [12,13].

2014-08-15math.COmath.MG

关于直线上一般意义下的泛刚性

On generic universal rigidity on the line

本文研究一维情形下的一般意义下泛刚性图，通过构造反例否定Connelly的猜想性刻画，并引入两种保持或破坏泛刚性的新操作，从而得到泛刚性图规模的下界，部分回答了Jordán和Nguyen的公开问题。

2023-05-23math.COmath.MG

平面上点线构型的射影刚性

Projective rigidity of point-line configurations in the plane

本文提出“射影刚性矩阵”框架研究平面上点线构型的保关联运动，并引入对称自适应矩阵分析对称构型及其保对称运动。

2025-03-05math.AGmath.COmath.DG

Global rigidity of 2-dimensional linearly constrained frameworks

A linearly constrained framework in $\mathbb{R}^d$ is a point configuration together with a system of constraints which fixes the distances between some pairs of points and additionally restricts some of the points to lie in given affine subspaces. It is globally rigid if the configuration is uniquely defined by the constraint system, and is rigid if it is uniquely defined within some small open neighbourhood. Streinu and Theran characterised generic rigidity of linearly constrained frameworks in $\mathbb{R}^2$ in 2010. We obtain an analagous characterisation for generic global rigidity in $\m…

2019-07-17math.COmath.MG

A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in $\mathbb{R}^2$

We study the bar-and-joint frameworks in $\mathbb{R}^2$ such that some vertices are constrained to lie on some lines. The generic rigidity of such frameworks is characterised by Streinu and Theran (2010). Katoh and Tanigawa (2013) remarked that the corresponding matroid and its rank function can be characterised by using a submodular function. In this paper, we will transfer this characterisation of the rank function to the form of the value of a ``1-thin cover" and obtain a sufficient connectivity condition for rigidity and global rigidity of these frameworks analogous to the results of Lovás…

2022-12-08math.CO

更多相关论文收起更多论文

A characterisation of the generic rigidity of 2-dimensional point-line frameworks

A 2-dimensional point-line framework is a collection of points and lines in the plane which are linked by pairwise constraints that fix some angles between pairs of lines and also some point-line and point-point distances. It is rigid if every continuous motion of the points and lines which preserves the constraints results in a point-line framework which can be obtained from the initial framework by a translation or a rotation. We characterise when a generic point-line framework is rigid. Our characterisation gives rise to a polynomial algorithm for solving this decision problem.

2016-01-06math.COmath.MG

Exploring the infinitesimal rigidity of planar configurations of points and rods

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 the rigidity properties of geometric realizations of incidence geometries in relation to the rigidity of geometric realizations of other well-known structures, such as graphs and hypergraphs.The $2$-plane matroid is also discussed. Further, we extend a result of Whiteley to determine necessary conditions for an incidence geometry of points and lines with exac…

2022-04-27math.AGmath.CO

Rigidity of linearly-constrained frameworks

We consider the problem of characterising the generic rigidity of bar-joint frameworks in $\mathbb{R}^d$ in which each vertex is constrained to lie in a given affine subspace. The special case when $d=2$ was previously solved by I. Streinu and L. Theran in 2010. We will extend their characterisation to the case when $d\geq 3$ and each vertex is constrained to lie in an affine subspace of dimension $t$, when $t=1,2$ and also when $t\geq 3$ and $d\geq t(t-1)$. We then point out that results on body-bar frameworks obtained by N. Katoh and S. Tanigawa in 2013 can be used to characterise when a gra…

2018-06-29math.COmath.MG

平面中射影变换下的刚性计数

Counting for rigidity under projective transformations in the plane

本文通过线性化点线关联的二次约束系统，引入射影刚性矩阵，用列相关刻画无穷小运动、行相关刻画自应力，并证明自应力由三重平衡刻画，从而研究平面射影变换下的刚性计数问题。

2025-03-10math.COmath.MG

线约束框架的全局刚性

Global Rigidity of Line Constrained Frameworks

本文研究了线约束杆-关节框架的全局刚性，在温和假设下给出了图的完整组合刻画，并推广了1维结果到任意维数。

2023-10-12math.CO

Configurations of lines in space and combinatorial rigidity

Let $L$ be a sequence $(\ell_1,\ell_2,\ldots,\ell_n)$ of $n$ lines in $\mathbb{C}^3$. We define the {\it intersection graph} $G_L=([n],E)$ of $L$, where $[n]:=\{1,\ldots, n\}$, and with $\{i,j\}\in E$ if and only if $i\neq j$ and the corresponding lines $\ell_i$ and $\ell_j$ intersect, or are parallel (or coincide). For a graph $G=([n],E)$, we say that a sequence $L$ is a {\it realization} of $G$ if $G\subset G_L$. One of the main results of this paper is to provide a combinatorial characterization of graphs $G=([n],E)$ that have the following property: For every {\it generic} realization $L$ …

2016-07-14cs.CGcs.DMmath.CO