A convex set with a rich difference
Oliver Roche-Newton, Audie Warren

TL;DR
This paper constructs a convex set with a specific difference set property and proves that this construction is optimal, establishing a maximum number of representations for elements in the difference set.
Contribution
It introduces a convex set with a rich difference property and proves the optimality of this construction in terms of representation counts.
Findings
Constructed a convex set with a difference set where elements have multiple representations.
Proved that the maximum number of representations for any element in the difference set is half the size of the set.
Established the optimality of the construction with a proven upper bound.
Abstract
We construct a convex set with cardinality and with the property that an element of the difference set can be represented in different ways. We also show that this construction is optimal by proving that for any convex set , the maximum possible number of representations an element of can have is .
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
Topicsgraph theory and CDMA systems
