Alec Kriebel

Full stress stratifications determine a labelled graph

Can the way a graph's self-stresses change across all placements reveal its edges? This note gives an exact reconstruction rule when vertex labels and the full configuration space are retained. The comparison is literal equality of partitions in that fixed space.

The proof uses Panina's known singleton-support collision detector and earlier collinear stress observations, within the Doray–Karpenkov–Schepers coordinate-sign framework. These ingredients receive prior credit; the note presents their explicit reconstruction consequence.

Abstract

For a simple labelled graph, consider the full configuration space, including vertex collisions, partitioned into connected components of coordinate-sign equivalence classes of self-stress spaces. We prove that two graphs induce identical partitions precisely when their edge sets agree. More explicitly, an edge is recovered by asking whether its collision diagonal is a union of strata. This answers the literal equality formulation of Karpenkov's Problem 4. The proof combines the known singleton-support collision criterion with an explicit positive diagonal transport along a collinear path. The comparison convention is essential: nonisomorphic trees can have ambient-linearly equivalent stratifications.

The precise reconstruction rule

Fix positive integers n,d and simple undirected graphs on the same labelled vertex set [n], retaining isolated vertices. A placement P = (p₁,…,pₙ) belongs to the entire space X = (Rd)n. Vertex collisions, self-intersections and deficient affine spans are allowed.

A self-stress assigns one real weight wij = wji to each unordered edge, with equilibrium at every vertex:

Σj : {i,j} ∈ E(G) wij(pj − pi) = 0.

Two placements of the same graph are equivalent when a homeomorphism between their full stress spaces preserves every edge coordinate's sign, including zero. A stratum is a connected component of such an equivalence class. Write Sd(G) for this partition of X and Δij = {P : pi = pj} for a named collision diagonal.

{i,j} ∈ E(G) ⇔ Δij is a union of whole strata of Sd(G).

Consequently, Sd(G) = Sd(H) as collections of subsets of this same labelled X exactly when E(G) = E(H). A specified permutation of vertex labels carries one partition to the other exactly when it carries the corresponding graphs to one another.

Why collisions detect edges

If {i,j} is an edge, a stress positive only on that edge satisfies equilibrium precisely when its endpoints coincide. A coordinate-sign-preserving homeomorphism preserves the existence of this singleton-support stress. Thus an equivalence class, and each of its connected strata, cannot mix collapsed and noncollapsed placements of that edge.

For a missing pair, choose a nonzero direction a and move pi(t) = ta past pj(t) = 0 for −1/2 ≤ t ≤ 1/2, keeping every other point at its distinct position (k + 1)a. No actual graph edge collapses. Along this collinear path, rescaling each stress coordinate by the ratio of its old and new scalar edge differences gives an invertible positive diagonal map between the stress spaces.

Every placement on the continuous path is therefore in one equivalence class. The connected path lies in one connected component of that class, so a single stratum crosses the missing pair's collision diagonal. That diagonal cannot be a union of whole strata. The argument uses the complete path, rather than assuming that equivalent endpoints must lie in the same component.

Why the comparison convention matters

Literal equality in the prescribed labelled space is essential. The four-vertex path with edges 12,23,34 and the star with edges 12,13,14 are nonisomorphic, yet their full stress stratifications are ambient-linearly equivalent. For a forest, stresses are supported exactly on collapsed edges, with arbitrary independent weights there. The change of coordinates

q₁ = p₁,   q₂ = p₂,   q₃ = p₁ + p₃ − p₂,   q₄ = p₁ + p₄ − p₃

is invertible and matches the path's three edge differences with the star's. It therefore carries the corresponding fibre classes and their connected components to one another. Their partitions remain unequal as subsets of the original fixed labelled X.

The theorem concerns simple graphs and n,d ≥ 1. It does not classify arbitrary ambient or abstract equivalences, collision-free or generic-only spaces, or pure-condition comparisons. Its relation to Karpenkov's Problem 4 is explicitly the literal equality formulation; it does not infer the author's unwritten intention or certify an exhaustive priority claim.

Proof and supporting evidence

The written singleton-support and connected-path arguments establish the universal theorem. Exact-rational calculations in the supporting package corroborate the formulas and selected boundary cases; finite computations do not prove connectedness or the statement for every positive n,d. The full Cartesian force convention is specified explicitly, rather than replaced by noncollapsed realizations or an affine quotient. No formal proof-assistant certificate is claimed.

Paper and supporting materials

Open the unchanged published PDF · Download PDF · Zenodo original PDF

Download the original source and verification ZIP · Zenodo original ZIP · Download BibTeX

The ZIP contains the TeX source, supporting exact checks, source references and reproduction instructions. The Zenodo record preserves the archived release.

Scholarly sources and prior credit

  • Doray, Karpenkov and Schepers, Geometry of configuration spaces of tensegrities: journal reference and author preprint v2, for the stress-space and connected coordinate-sign conventions.
  • Karpenkov, Open Problems on Configuration Spaces of Tensegrities: journal reference, especially the definitions and literal Problem 4.
  • Panina, A universality theorem for stressable graphs in the plane: journal reference and author preprint v4, for the collapsed-edge detector and collinear observations.

No first-priority claim is made for the collision detector, stress-equivalence machinery, collinear invariance or incidence normalization.

Citation and rights

Alec Kriebel. Full stress stratifications determine a labelled graph. Version 1.0, 12 October 2026. Zenodo. doi:10.5281/zenodo.23331540.

The authored material in this release is available under CC BY 4.0, as stated in the native metadata and package. Cited work retains its original authorship and rights.

Contributions and collaboration

Independent verification of the proof or substantive work toward a journal version would be welcome. Authorship would be based on actual mathematical contributions.

AI use and publication status

AI tools were used extensively in developing and checking the arguments, source work and preparation. Internal adversarial reviews were AI-assisted. This is an unrefereed research note; conventional human peer review and journal acceptance are not claimed.