Counting on Frameworks

The problems considered by Counting on Frameworks primarily concern systems of rigid rods, connected to each other by flexible joints at their ends; the question is whether these connections fix such a framework into a single position, or whether it can flex continuously through multiple positions. Variations of this problem include the simplest way to add rods to a framework to make it rigid, or the resiliance of a framework against the failure of one of its rods.[2]

To study this question, Graver has organized Counting on Frameworks into four chapters. The first chapter studies square grids and methods of cross bracing the grid to make it rigid, as a way of introducing the notion of the degrees of freedom of a mechanical system.[1][3][4] The second chapter provides an introduction to graph theory, the one-dimensional theory of rigidity through the analysis of the connected components of graphs, and a reformulation of the grid bracing problem in terms of connectivity of an associated bipartite graph.[1][3][4][5] Chapter three concerns two-dimensional rigidity, the concepts of infinitesimal and generic rigidity, the combinatorial and algorithmic aspects of the subject, and the obstacles to extending this theory to three dimensions. A final chapter describes the history of rigidity theory, applications including mechanical linkages, geodesic domes, tensegrity, the rigidity of molecules in chemistry, and even art. It also discusses open problems for research in this area.[1][3][4]

Counting on Frameworks expects its readers to be familiar with multivariable calculus, but beyond that level of background material it does not demand much mathematical sophistication.[5] More generally, the editors of Mathematika recommend it to "Any reader with at least a slight mathematical background".[6] To avoid demanding too much background of its readers, it is unable to present full proofs of some of its results, instead presenting them as intuitive proof sketches. A more advanced and rigorous treatment of the same material can be found in Combinatorial Rigidity (1993), a graduate textbook co-authored by Graver.[1]

It includes exercises for students,[1][4] making it suitable as an undergraduate textbook.[5] Reviewer Tiong Seng Tay describes it as "an excellent expository book".[3]