Stress-linked pairs of vertices and the generic stress matroid
D\'aniel Garamv\"olgyi

TL;DR
This paper introduces the concept of $d$-stress-linked vertex pairs in graphs, explores their properties, and relates them to global linkage and rigidity, providing new combinatorial and matroidal characterizations in rigidity theory.
Contribution
The paper defines and studies $d$-stress-linked pairs, introduces the $d$-dimensional generic stress matroid, and connects these concepts to global linkage and rigidity conjectures.
Findings
$d$-stress-linked pairs are globally linked in $ ext{R}^d$
Provides a combinatorial characterization of 2-stress-linked pairs in $ ext{R}^2$
Answers several conjectures on rigidity and global linkage
Abstract
Given a graph and a mapping , we say that the pair is a (-dimensional) realization of . Two realizations and are equivalent if each of the point pairs corresponding to the edges of have the same distance under the embeddings and . A pair of vertices is globally linked in in if for every generic realization and every equivalent realization , and are also equivalent. In this paper, we introduce and investigate the notion of -stress-linked vertex pairs. Roughly speaking, a pair of vertices is -stress-linked in if the edge is generically stressed in and for every generic -dimensional realization , every configuration that satisfies the equilibrium stresses of also satisfies the equilibrium stresses…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStructural Analysis and Optimization · Computational Geometry and Mesh Generation · Mechanical Behavior of Composites
