English

Small Sets with Large Difference Sets

Combinatorics 2017-05-25 v1

Abstract

For every ϵ>0\epsilon > 0 and kNk \in \mathbb{N}, Haight constructed a set AZNA \subset \mathbb{Z}_N (ZN\mathbb{Z}_N stands for the integers modulo NN) for a suitable NN, such that AA=ZNA-A = \mathbb{Z}_N and kA<ϵN|kA| < \epsilon N. Recently, Nathanson posed the problem of constructing sets AZNA \subset \mathbb{Z}_N for given polynomials pp and qq, such that p(A)=ZNp(A) = \mathbb{Z}_N and q(A)<ϵN|q(A)| < \epsilon N, where p(A)p(A) is the set {p(a1,a2,,an). ⁣:.a1,a2,,anA}\{p(a_1, a_2, \dots, a_n)\phantom{.}\colon\phantom{.}a_1, a_2, \dots, a_n \in A\}, when pp has nn variables. In this paper, we give a partial answer to Nathanson's question. For every kNk \in \mathbb{N} and ϵ>0\epsilon > 0, we find a set AZNA \subset \mathbb{Z}_N for suitable NN, such that AA=ZNA- A = \mathbb{Z}_N, but A2+kA<ϵN|A^2 + kA| < \epsilon N, where A2+kA={a1a2+b1+b2++bk. ⁣:.a1,a2,b1,,bkA}A^2 + kA = \{a_1a_2 + b_1 + b_2 + \dots + b_k\phantom{.}\colon\phantom{.}a_1, a_2,b_1, \dots, b_k \in A\}. We also extend this result to construct, for every kNk \in \mathbb{N} and ϵ>0\epsilon > 0, a set AZNA \subset \mathbb{Z}_N for suitable NN, such that AA=ZNA- A = \mathbb{Z}_N, but 3A2+kA<ϵN|3A^2 + kA| < \epsilon N, where 3A2+kA={a1a2+a3a4+a5a6+b1+b2++bk. ⁣:.a1,,a6,b1,,bkA}3A^2 + kA = \{a_1a_2 + a_3a_4 + a_5a_6 + b_1 + b_2 + \dots + b_k\phantom{.}\colon\phantom{.}a_1, \dots, a_6,b_1, \dots, b_k \in A\}.

Keywords

Cite

@article{arxiv.1705.08760,
  title  = {Small Sets with Large Difference Sets},
  author = {Luka Milicevic},
  journal= {arXiv preprint arXiv:1705.08760},
  year   = {2017}
}

Comments

22 pages