2022/08/05 by Oliver Roche‐Newton, Roche-Newton, Oliver, Audie Warren +1 · 1 citation
Engineering · #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2208.03258
openalex publication_date 2022/08/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We construct a convex set A with cardinality 2n and with the property that an element of the difference set A-A can be represented in n different ways. We also show that this construction is optimal by proving that for any convex set A, the maximum possible number of representations an element of A-A can have is \lfloor |A|/2 \rfloor .