Thematic Program on Geometric Constraint Systems, Framework Rigidity, and Distance Geometry
January 1  June 30, 2021
Description
The study of geometric rigidity can be traced back to historical figures such as A. Cauchy who, in 1813, proved convex polyhedra are rigid. Subsequent work extending Cauchy’s theorem by Dehn, Alexandrov and Pogolerov continued into the 1940’s and 50’s. Similarly, combinatorial rigidity can be traced to J. C. Maxwell who, in 1864, developed necessary combinatorial, graphbased, conditions for barjoint structures to be rigid. Hilda PolaczekGeiringer proved in 1920 that Maxwell’s condition is sufficient in 2 dimensions. In fact, for most categories of frameworks, each constraint typically involves a pair of primitives. Hence, the framework and the constraint system has an underlying constraint graph of vertices representing the primitives and edges representing the constraints. Generic properties of the constraint system or the framework are often purely combinatorial properties of the underlying constraint graph. The useful interplay between the geometric and the combinatorial was further apparent in e.g. the relation between planar framework selfstresses, MaxwellCremona reciprocal diagrams, and polyhedral liftings; and the relation between conformal maps and Koebe’s theorem from the 30’s on rigidity of circle packings corresponding to maximal planar contact graphs.
Additionally, distance geometry questions going back to Schoenberg in the 20’s naturally entered the picture since constraints underlying many categories of frameworks are metric constraints. As a consequence of Schoenberg’s general result for Hilbert spaces, the realizability or solvability of a distance constraint system in (real) Euclidean space of a given dimension is equivalent to its completability as a distance matrix with appropriate rank (and semidefiniteness) conditions. Algebraically, the CayleyMenger determinantal relations  used by Menger in the 20’s to characterize Euclidean realizability of distance constraints  can be viewed as szyzygies of polynomial invariants of the Euclidean group. A similar triad connects incidence constraints, GrassmanPluecker relations and the projective group. Algorithmically, the characterization of (generic) rigidityrelated properties of frameworks, as well as describing and exploring the solution spaces of geometric constraint sytems are fundamental problems with clear classical connections, for example, to: Galois field extensions (e.g. via ruler and compass constructions); Kempe’s 1876 description of algebraic curves using barjoint linkages with prescribed bar lengths; GrassmanCayley algebra derivations in projective geometry; and more generally polynomial system solving and ideal membership questions.
Hence right from its origins, the rigidity of frameworks emerged as a source of rich, crosscutting problems at the nexus of geometry, algebra, combinatorics and algorithmic foundations. Moreover, being remarkably amenable to spatially and mechanically intuitive explanations of deep results, the area has attracted and welcomed researchers in a variety of fields and perspectives.
Yet, it is only much later, prompted by a rediscovery of the PolaczekGeiringer theorem by Laman in 1970, that rigidity theory began to develop as a mathematical subject area in its own right, leading to a steady output of substantial results in the decades since then. For a time, the flip side of this intense, focused development was somewhat reduced emphasis on the area’s natural connections with other areas. Recently, however, a multitude of problems from outside the core rigidity community have necessitated ‘rigiditytype’ results and methods. Some prominent examples include Kalai’s proof of the Lower Bound Theorem for manifolds and the recent work by several groups on low rank matrix completion problems. Such results, along with rigidityrelated problems arising in novel applications from materials modeling to machine learning, have led to a revitalization of the historical connections (and development of new connections) to distance geometry, semidefinite analysis and algebraic geometry.
The purpose of this program is to bring together a diverse range of experts and early career researchers to study and report progress on geometric constraint systems and their applications. Participants are expected from several synergistic areas within mathematics (discrete, algebraic and distance geometry, graphs and matroids) as well as theoretical computer science, engineering and the natural sciences.
Workshops and Conferences

Winter School on Geometric Constraint Systems
January 11  22, 2021

Minisymposium on Rigidity of Robotic Formations
February 17  19, 2021

Workshop on Progress and Open Problems in Rigidity Theory
February 22  26, 2021

Minisymposium on Materials and Periodicity
March 1  3, 2021

Minisymposium on Rigidity of Particle Cluster Assembly
April 7  9, 2021

Workshop on the Geometry of Circle Packings
April 12  16, 2021

Workshop on Distance Geometry, Semidefinite Programming and Applications
May 10  14, 2021

Minisymposium on Sensor Network Localization and Dynamical Distance Geometry
May 17  19, 2021

Minisymposium on Applications of Low Rank Matrix Completion
June 9  11, 2021

Workshop on Real Algebraic Geometry and Algorithms for Geometric Constraint Systems
June 14  18, 2021
Courses

Graduate Course on Real Algebraic Geometry and Kinematics
January 4  April 30, 2021

Graduate Course on Combinatorial Rigidity and Distance Geometry
January 4  April 30, 2021

Minicourse on Combinatorial Rigidity
February 17  19, 2021

Minicourse on Biomolecular Structure Determination from Measurements
May 5  7, 2021

Minicourse on Protein Conformation, Flexibility Modeling and Structural Allostery
May 5  7, 2021

Minicourse on Semidefinite Programming and Polynomial Systems
May 17  19, 2021

Minicourse on Polynomials and Kinematics
June 9  11, 2021