Which graphs are rigid in \(\ell_p^d\)?

DOI10.1007/s10898-021-01008-zzbMath1487.05156arXiv2007.15978OpenAlexW3137414324MaRDI QIDQ2131138

Anthony Nixon, Sean Dewar, Derek Kitson

Publication date: 25 April 2022

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.15978

zbMATH Keywords

normed spacesinfinitesimal rigiditybar-joint frameworkrigidity matroid

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matroids and geometric lattices (05B35) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Related Items (2)

The rigidity of infinite graphs. II ⋮ Coincident-point rigidity in normed planes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite and infinitesimal rigidity with polyhedral norms
• Generating the triangulations of the projective plane
• Graph rigidity for unitarily invariant matrix norms
• On graphs and rigidity of plane skeletal structures
• The \(d\)-dimensional rigidity matroid of sparse graphs
• Equivalence of continuous, local and infinitesimal rigidity in normed spaces
• Infinitesimal Rigidity in Normed Planes
• Rotation in a Normed Plane
• Infinitesimal rigidity for non-Euclidean bar-joint frameworks

This page was built for publication: Which graphs are rigid in \(\ell_p^d\)?