Rigid
A Framework is rigid Iff continuous motion of the points of the configuration maintaining the barconstraints comes from a family of motions of all Euclidean Space which are distance-preserving. A Graph 
is (generically) 
-rigid if, for almost all (i.e., an open dense set of)Configurations of 
, the Framework 
is rigid in 
.
One of the first results in rigidity theory was the Rigidity Theorem by Cauchy in 1813. Although rigidity problemswere of immense interest to engineers, intensive mathematical study of these types of problems has occurred onlyrelatively recently (Connelly 1993, Graver et al. 1993).
See also Bar (Edge), Flexible Polyhedron, Framework, Laman's Theorem, Liebmann's Theorem, Rigidity Theorem
References
Connelly, R. ``Rigidity.'' Ch. 1.7 in Handbook of Convex Geometry, Vol. A (Ed. P. M. Gruber and J. M. Wills). Amsterdam, Netherlands: North-Holland, pp. 223-271, 1993. Crapo, H. and Whiteley, W. ``Statics of Frameworks and Motions of Panel Structures, A Projective Geometry Introduction.'' Structural Topology 6, 43-82, 1982. Graver, J.; Servatius, B.; and Servatius, H. Combinatorial Rigidity. Providence, RI: Amer. Math. Soc., 1993.
- Sextillion
- Sexy Primes
- Seydewitz's Theorem
- Sgn
- Shadow
- Shadowing Theorem
- Shafarevich Conjecture
- Shah Function
- Shah-Wilson Constant
- Shallit Constant
- Shallow Diagonal
- Shanks' Algorithm
- Shanks' Conjecture
- Shannon Entropy
- Shannon Sampling Theorem
- Shape Operator
- Shapiro's Cyclic Sum Constant
- Sharing Problem
- Sharkovsky's Theorem
- Sharpe Ratio
- Sharpe's Differential Equation
- Sheaf (Geometry)
- Sheaf (Topology)
- Shear
- Shear Matrix