Universally Rigid Framework Attachments

A framework is a graph and a map from its vertices to R^d. A framework is called universally rigid if there is no other framework with the same graph and edge lengths in R^d' for any d'. A framework attachment is a framework constructed by joining two frameworks on a subset of vertices. We consider an attachment of two universally rigid frameworks that are in general position in R^d. We show that the number of vertices in the overlap between the two frameworks must be sufficiently large in order for the attachment to remain universally rigid. Furthermore, it is shown that universal rigidity of such frameworks is preserved even after removing certain edges. Given positive semidefinite stress matrices for each of the two initial frameworks, we analytically derive the PSD stress matrices for the combined and edge-reduced frameworks. One of the benefits of the results is that they provide a general method for generating new universally rigid frameworks.

[1]  T. Gonen,et al.  Questions , 1927, Journal of Family Planning and Reproductive Health Care.

[2]  Bruce Hendrickson,et al.  Conditions for Unique Graph Realizations , 1992, SIAM J. Comput..

[3]  Brian D. O. Anderson,et al.  Rigidity, computation, and randomization in network localization , 2004, IEEE INFOCOM 2004.

[4]  Yinyu Ye,et al.  Toward the Universal Rigidity of General Frameworks , 2010, 1009.1185.

[5]  R. Tennant Algebra , 1941, Nature.

[6]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[7]  Nathan Linial,et al.  The geometry of graphs and some of its algorithmic applications , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[8]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[9]  R. Connelly Rigidity and energy , 1982 .

[10]  B. Parlett The Symmetric Eigenvalue Problem , 1981 .

[11]  Yinyu Ye,et al.  On affine motions and bar frameworks in general position , 2010, 1009.3318.

[12]  B. Roth,et al.  The rigidity of graphs , 1978 .

[13]  Robert Connelly,et al.  Generic Global Rigidity , 2005, Discret. Comput. Geom..

[14]  Gábor Pataki,et al.  On the generic properties of convex optimization problems in conic form , 2001, Math. Program..