Graph rigidity for unitarily invariant matrix norms

DOI10.1016/J.JMAA.2020.124353MaRDI QIDQ2207654zbMATH OpenOpenAlexFDO

Authors Derek Kitson, Rupert H. Levene

Publication date 23 October 2020

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

infinitesimal rigiditymatrix normmatroidLaman graph

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Abstract: A rigidity theory is developed for bar-joint frameworks in linear matrix spaces endowed with a unitarily invariant norm. Analogues of Maxwell's counting criteria are obtained and minimally rigid matrix frameworks are shown to belong to the matroidal class of (k,l)-sparse graphs for suitable k and l. A characterisation of infinitesimal rigidity is obtained for product norms and it is shown that K_6 - e (respectively, K_7) is the smallest minimally rigid graph for the class of 2 x 2 symmetric (respectively, hermitian) matrices with the trace norm.

Recommendations

• Rigidity of symmetric frameworks in normed spaces
• Infinitesimal Rigidity in Normed Planes
• Finite and infinitesimal rigidity with polyhedral norms
• Maxwell-Laman counts for bar-joint frameworks in normed spaces
• Which graphs are rigid in \(\ell_p^d\)?

Cites work

• scientific article; zbMATH DE number 501471 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• Approximate Isometries on Euclidean Spaces
• Characterization of the subdifferential of some matrix norms
• Constructive characterizations for packing and covering with trees
• Decomposition of Finite Graphs Into Forests
• Duality between some linear preserver problems. III: c-spectral norms and (skew)-symmetric matrices with fixed singular values
• Finite and infinitesimal rigidity with polyhedral norms
• Infinitesimal rigidity for non-Euclidean bar-joint frameworks
• Infinitesimally Rigid Polyhedra. I. Statics of Frameworks
• Infinitesimally Rigid Polyhedra. II: Modified Spherical Frameworks
• Isometries of norm ideals of compact operators
• Linear operators preserving unitarily invariant norms of matrices
• Linear operators preserving unitary similarity invariant norms
• Maxwell-Laman counts for bar-joint frameworks in normed spaces
• On Generic Rigidity in the Plane
• On graphs and rigidity of plane skeletal structures
• Packing of rigid spanning subgraphs and spanning trees
• Pebble game algorithms and sparse graphs
• Rigidity of periodic and symmetric structures in nature and engineering
• Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
• The Rigidity of Graphs
• The isometries of \(C_p\)
• The rigidity of graphs. II

Cited in

(9)

• Coboundary operators for infinite frameworks
• Which graphs are rigid in \(\ell_p^d\)?
• Equivalence of continuous, local and infinitesimal rigidity in normed spaces
• Graph rigidity via Euclidean distance matrices
• Infinitesimal Rigidity in Normed Planes
• Coincident-point rigidity in normed planes
• Mechanism creation in tensegrity structures by cellular morphogenesis
• Generalised rigid body motions in non-Euclidean planes with applications to global rigidity
• Homothetic packings of centrally symmetric convex bodies

This page was built for publication: Graph rigidity for unitarily invariant matrix norms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2207654)