A convex set with a rich difference

DOI10.1007/S10474-022-01286-3MaRDI QIDQ6407098arXivFDO

Authors Oliver Roche-Newton, Audie Warren

Publication date 5 August 2022

Published in arXiv

Full work available at URL https://doi.org/10.1007/S10474-022-01286-3

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13) Arithmetic combinatorics; higher degree uniformity (11B30)

arXiv classification

math.CO

Abstract: 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|/2floor$.

This page was built for publication: A convex set with a rich difference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6407098)