Year: 2013
Type: preprint
Abstract: A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 12 a countable graph which is rigid for generic placements in R^d may fail the stronger property of sequential rigidity, while for d=2 the equivalence with sequential rigidity is obtained from the generalised Laman characterisations. Applications are given to the flexibility of non-Euclidean convex polyhedra and to the infinitesimal and continuous rigidity of compact infinitely-faceted simplicial polytopes.
Source: arXiv (Cornell University)
Authors: Kitson, D., Power, S. C.
Institution: Lancaster University
Language: English
Topic: Mathematics and Applications
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1759301240