On Flattenability of Graphs
Meera Sitharam, Joel Willoughby

TL;DR
This paper generalizes the concept of graph flattenability from Euclidean to general $l_p$ norms, establishing key equivalences with convexity of configuration spaces and properties of frameworks, with specific results for $l_1$ and $l_$ norms.
Contribution
It extends flattenability theory to $l_p$ norms, linking it to convexity, rigidity, and independence properties, and provides new characterizations for 2-flattenability in $l_1$ and $l_$ norms.
Findings
Flattenability is equivalent to convexity of Cayley configuration spaces.
Flattenability and convexity are not generic properties in arbitrary dimensions.
Existence of a generic flattenable framework implies edge independence.
Abstract
We consider a generalization of the concept of -flattenability of graphs - introduced for the norm by Belk and Connelly - to general norms, with integer , , though many of our results work for as well. The following results are shown for graphs , using notions of genericity, rigidity, and generic -dimensional rigidity matroid introduced by Kitson for frameworks in general norms, as well as the cones of vectors of pairwise distances of a finite point configuration in -dimensional, space: (i) -flattenability of a graph is equivalent to the convexity of -dimensional, inherent Cayley configurations spaces for , a concept introduced by the first author; (ii) -flattenability and convexity of Cayley configuration spaces over specified non-edges of a -dimensional framework are not generic properties…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStructural Analysis and Optimization · Advanced Materials and Mechanics · Computational Geometry and Mesh Generation
