2000 character limit reached
Rigidity of symmetric frameworks in normed spaces
Published 13 Aug 2018 in math.MG and math.CO | (1808.04484v2)
Abstract: We develop a combinatorial rigidity theory for symmetric bar-joint frameworks in a general finite dimensional normed space. In the case of rotational symmetry, matroidal Maxwell-type sparsity counts are identified for a large class of $d$-dimensional normed spaces (including all $\ellp$ spaces with $p\not=2$). Complete combinatorial characterisations are obtained for half-turn rotation in the $\ell1$ and $\ell\infty$-plane. As a key tool, a new Henneberg-type inductive construction is developed for the matroidal class of $(2,2,0)$-gain-tight graphs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.