Rigidity with few locations
Combinatorics
2019-12-03 v3
Abstract
Graphs triangulating the -sphere are generically rigid in -space, due to Gluck-Dehn-Alexandrov-Cauchy. We show there is a \emph{finite} subset in -space so that the vertices of each graph as above can be mapped into to make the resulted embedding of infinitesimally rigid. This assertion extends to the triangulations of any fixed compact connected surface, where the upper bound obtained on the size of increases with the genus. The assertion fails, namely no such finite exists, for the larger family of all graphs that are generically rigid in -space and even in the plane.
Cite
@article{arxiv.1806.03322,
title = {Rigidity with few locations},
author = {Karim Adiprasito and Eran Nevo},
journal= {arXiv preprint arXiv:1806.03322},
year = {2019}
}
Comments
11 pages, to appear in Isr. J. Math