Papers › Bracing frameworks consisting of parallelograms
Bracing frameworks consisting of parallelograms
Georg Grasegger, Jan Legerský
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
A rectangle in the plane can be continuously deformed preserving its edge lengths, but adding a diagonal brace prevents such a deformation. Bolker and Crapo characterized combinatorially which choices of braces make a grid of squares infinitesimally rigid using a bracing graph: a bipartite graph whose vertices are the columns and rows of the grid, and a row and column are adjacent if and only if they meet at a braced square. Duarte and Francis generalized the notion of the bracing graph to rhombic carpets, proved that the connectivity of the bracing graph implies rigidity and stated the other implication without proof. Nagy Kem gives the equivalence in the infinitesimal setting. We consider continuous deformations of braced frameworks consisting of a graph from a more general class and its placement in the plane such that every 4-cycle forms a parallelogram. We show that rigidity of such a braced framework is equivalent to the non-existence of a special edge coloring, which is in turn equivalent to the corresponding bracing graph being connected.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections