Uniquely realisable graphs in analytic normed planes

arXiv2206.07426MaRDI QIDQ6402160FDOQ6402160

Author name not available (Why is that?), Anthony Nixon, Sean Dewar

Publication date: 15 June 2022

Abstract: A bar-joint framework $(G,p)$ in the Euclidean space $mathbb{E}^d$ is globally rigid if it is the unique realisation, up to rigid congruences, of $G$ in $mathbb{E}^d$ with the edge lengths of $(G,p)$. Building on key results of Hendrickson and Connelly, Jackson and Jord'{a}n gave a complete combinatorial characterisation of when a generic framework is global rigidity in $mathbb{E}^2$. We prove an analogous result when the Euclidean norm is replaced by any norm that is analytic on $mathbb{R}^{2}setminus0$. More precisely, we show that a graph $G=(V,E)$ is globally rigid in a non-Euclidean analytic normed plane if and only if $G$ is 2-connected and $G-e$ contains 2 edge-disjoint spanning trees for all $einE$. The main technical tool is a recursive construction of 2-connected and redundantly rigid graphs in analytic normed planes. We also obtain some sufficient conditions for global rigidity as corollaries of our main result and prove that the analogous necessary conditions hold in $d$-dimensional analytic normed spaces.

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Convexity and finite-dimensional Banach spaces (including special norms, zonoids, etc.) (aspects of convex geometry) (52A21) Non-Euclidean differential geometry (53A35) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

This page was built for publication: Uniquely realisable graphs in analytic normed planes

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