Show simple item record

dc.contributor.creatorDewar, Sean
dc.contributor.creatorKitson, Derek
dc.contributor.creatorNixon, Anthony
dc.identifier.citationDewar, S., Kitson, D. & Nixon, A. Which graphs are rigid in ℓdp?. J Glob Optim (2021).
dc.description.abstractWe present three results which support the conjecture that a graph is minimally rigid in d-dimensional ℓp-space, where p∈(1,∞) and p≠2, if and only if it is (d, d)-tight. Firstly, we introduce a graph bracing operation which preserves independence in the generic rigidity matroid when passing from ℓdp to ℓd+1p. We then prove that every (d, d)-sparse graph with minimum degree at most d+1 and maximum degree at most d+2 is independent in ℓdp. Finally, we prove that every triangulation of the projective plane is minimally rigid in ℓ3p. A catalogue of rigidity preserving graph moves is also provided for the more general class of strictly convex and smooth normed spaces and we show that every triangulation of the sphere is independent for 3-dimensional spaces in this class.en_US
dc.description.sponsorshipD.K. supported by the Engineering and Physical Sciences Research Council (Grant Numbers EP/P01108X/1 and EP/S00940X/1). S.D. supported by the Austrian Science Fund (FWF): P31888.en_US
dc.relation.ispartofseriesJournal of Global Optimization;
dc.subjectResearch Subject Categories::MATHEMATICS::Algebra, geometry and mathematical analysis::Algebra and geometryen_US
dc.titleWhich graphs are rigid in lpd?en_US

Files in this item


This item appears in the following Collection(s)

Show simple item record
Except where otherwise noted, this item's license is described as