The Dyn-Farkhi conjecture and the convex hull of a sumset in two dimensions
Mark Meyer

TL;DR
This paper proves the Dyn-Farkhi conjecture for the case of two dimensions, demonstrating that the squared Hausdorff distance to the convex hull is subadditive in this setting, and provides a new representation of sumsets in the plane.
Contribution
The paper establishes the conjecture in 2D and introduces a novel representation of the sumset of convex hulls for full-dimensional compact sets in the plane.
Findings
Proved the Dyn-Farkhi conjecture for n=2.
Derived a new representation of the sumset of convex hulls in 2D.
Confirmed the conjecture's validity specifically in two-dimensional space.
Abstract
For a compact set in the Hausdorff distance from to is defined by \begin{equation*} d(A):=\sup_{a\in\text{conv}(A)}\inf_{x\in A}|x-a|, \end{equation*} where for we use the notation . It was conjectured in 2004 by Dyn and Farkhi that is subadditive on compact sets in . In 2018 this conjecture was proved false by Fradelizi et al. when . The conjecture can also be verified when . In this paper we prove the conjecture when and in doing so we prove an interesting representation of the sumset for full dimensional compact sets in .
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
TopicsLimits and Structures in Graph Theory · Graph theory and applications
