About This Project

An academic exploration of the mathematical connections between graphs, matroids, and mechanical linkages.

The Dimension Folding Problem

A central question in rigidity theory

Given a graph G realized as a linkage in ℝᵈ (where edges represent rigid bars of fixed length), what is the minimal dimension ℝᵏ (k ≤ d) into which it can be continuously deformed while preserving all edge lengths?

This question bridges several areas of mathematics:

  • Graph Theory — The combinatorial structure determines possible motions
  • Rigidity Theory — Understanding when frameworks are rigid vs. flexible
  • Matroid Theory — Algebraic abstraction of independence in graphs
  • Kinematics — The geometry of motion in mechanical systems

Key Examples

K₁,₂ (V-shape)
Folds to 1D

K₃ (Triangle)
Minimal 2D

K₄ (Tetrahedron)
Minimal 3D

K₂,₃ (Bipartite)
1 DOF in 2D

Mathematical Framework

A framework is a pair (G, p) where G is a graph and p: V → ℝᵈ assigns positions to vertices.

The rigidity matrix R is the Jacobian of the edge length constraints. Its kernel describes infinitesimal motions.

A framework is infinitesimally rigid if the only solutions to Rv = 0 are rigid motions (rotations + translations).

Technology Stack

Built with modern web technologies

SolidJS
SolidStart
Three.js
Graphology
Tailwind CSS
SolidUI
TypeScript

References

Foundational papers and resources

Laman, G. (1970). "On graphs and rigidity of plane skeletal structures." Journal of Engineering Mathematics, 4(4), 331-340.

Connelly, R. (1980). "The rigidity of certain cabled frameworks."Advances in Mathematics, 37(3), 272-299.

Whiteley, W. (1996). "Some matroids from discrete applied geometry."Contemporary Mathematics, 197, 171-311.

Graver, Servatius & Servatius (1993).Combinatorial Rigidity. AMS Graduate Studies in Mathematics.