Pith. sign in

REVIEW 2 cited by

Stress-linked pairs of vertices and the generic stress matroid

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2308.16851 v2 pith:3GUOU2UO submitted 2023-08-31 math.CO math.AGmath.MG

classification math.COmath.AGmath.MG
keywords pairsgenericgloballystress-linkeddimensionaleverylinkedmathbb
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Given a graph $G$ and a mapping $p : V(G) \to \mathbb{R}^d$, we say that the pair $(G,p)$ is a ($d$-dimensional) realization of $G$. Two realizations $(G,p)$ and $(G,q)$ are equivalent if each of the point pairs corresponding to the edges of $G$ have the same distance under the embeddings $p$ and $q$. A pair of vertices $\{u,v\}$ is globally linked in $G$ in $\mathbb{R}^d$ if for every generic realization $(G,p)$ and every equivalent realization $(G,q)$, $(G+uv,p)$ and $(G+uv,q)$ are also equivalent. In this paper, we introduce and investigate the notion of $d$-stress-linked vertex pairs. Roughly speaking, a pair of vertices $\{u,v\}$ is $d$-stress-linked in $G$ if the edge $uv$ is generically stressed in $G+uv$ and for every generic $d$-dimensional realization $(G,p)$, every configuration $q$ that satisfies the equilibrium stresses of $(G,p)$ also satisfies the equilibrium stresses of $(G+uv,p)$. Among other results, we show that $d$-stress-linked vertex pairs are globally linked in $\mathbb{R}^d$, and we give a combinatorial characterization of $2$-stress-linked vertex pairs that matches the conjectural characterization of globally linked pairs in $\mathbb{R}^2$ due to Jackson et al. As a key tool, we introduce and study the ``algebraic dual'' of the $d$-dimensional generic rigidity matroid of a graph $G$, which we call the $d$-dimensional generic stress matroid of $G$. Our results about this matroid, which describes the global behavior of equilibrium stresses of generic realizations of $G$, may be of independent interest. We use our results to give positive answers to a conjecture of Jord\'an on minimally globally rigid graphs, a conjecture of Jord\'an and the author on globally linked vertex pairs, and to conjectures of Connelly and Grasegger et al. on rigidity properties of graphs with small separators.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Sparsity, Stress-Independence and Globally Linked Pairs in Graph Rigidity Theory

    math.CO 2025-09 conditional novelty 7.0 of 10

    Every d-stress-independent graph, including minimally globally d-rigid graphs and minimally R_d-connected graphs, is independent in the (d+1)-dimensional generic rigidity matroid.

  2. $k$-fold circuits and coning in rigidity matroids

    math.CO 2025-08 conditional novelty 7.0 of 10

    New results on k-fold circuits in d-dimensional rigidity matroids: R_d lacks the k-fold circuit property for d >= 4, sufficient balance conditions are given, and a coning reduction handles almost-cone graphs.

Pith tools