Hypo-paradoxical Linkages: Linkages That Should Move-But Don't

Classical mobility criteria, such as the Chebyshev-Grübler-Kutzbach formula (1904), offer a quick estimate for the number of degrees-of-freedom in linkage systems based on link and joint counts. However, several historical linkages defy these predictions, exhibiting unexpected motion despite appearing overconstrained. Such linkages are known as paradoxical linkages. In addition to Grübler's formula, rigidity criteria such as Laman's theorem provide a somewhat more complex condition for the rigidity of planar linkages. The theorem states that a graph with n vertices is minimally rigid in the plane if it has exactly 2n 3 edges, and no subset of k vertices spans more than 2k 3 edges. However, Laman's criterion also breaks down in the presence of non generic linkages necessitating deeper analysis of configuration spaces and infinitesimal rigidity (cf.