Files in this item
Generically globally rigid graphs have generic universally rigid frameworks
Item metadata
dc.contributor.author | Connelly, Robert | |
dc.contributor.author | Gortler, Steven | |
dc.contributor.author | Theran, Louis Simon | |
dc.date.accessioned | 2021-03-22T00:39:53Z | |
dc.date.available | 2021-03-22T00:39:53Z | |
dc.date.issued | 2020-03-22 | |
dc.identifier | 255207120 | |
dc.identifier | 6e49e638-1b0f-42cb-933f-31c2e0be86fc | |
dc.identifier | 000520959600001 | |
dc.identifier | 85082323452 | |
dc.identifier.citation | Connelly , R , Gortler , S & Theran , L S 2020 , ' Generically globally rigid graphs have generic universally rigid frameworks ' , Combinatorica , vol. 40 , pp. 1-37 . https://doi.org/10.1007/s00493-018-3694-4 | en |
dc.identifier.issn | 0209-9683 | |
dc.identifier.other | ORCID: /0000-0001-5282-4800/work/78891833 | |
dc.identifier.uri | https://hdl.handle.net/10023/21677 | |
dc.description.abstract | We show that any graph that is generically globally rigid in ℝd has a realization in ℝd both generic and universally rigid. It also must have a realization in ℝd that is both infinitesimally rigid and universally rigid. This also implies that the graph also must have a realization in ℝd that is both infinitesimally rigid and universally rigid; such a realization serves as a certificate of generic global rigidity. Our approach involves an algorithm by Lovász, Saks and Schrijver that, for a sufficiently connected graph, constructs a general position orthogonal representation of the vertices, and a result of Alfakih that shows how this representation leads to a stress matrix and a universally rigid framework of the graph. | |
dc.format.extent | 559677 | |
dc.language.iso | eng | |
dc.relation.ispartof | Combinatorica | en |
dc.subject | QA Mathematics | en |
dc.subject | T-NDAS | en |
dc.subject | BDC | en |
dc.subject.lcc | QA | en |
dc.title | Generically globally rigid graphs have generic universally rigid frameworks | en |
dc.type | Journal article | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.identifier.doi | 10.1007/s00493-018-3694-4 | |
dc.description.status | Peer reviewed | en |
dc.date.embargoedUntil | 2021-03-22 | |
dc.identifier.url | http://arxiv.org/abs/1604.07475 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.