Small Sets with Large Difference Sets

Abstract

For every ε > 0 and k ∈ N, Haight constructed a set A ⊂ ZN (ZN stands for the integers modulo N) for a suitable N, such that A-A = ZN and |kA| < ε N. Recently, Nathanson posed the problem of constructing sets A ⊂ ZN for given polynomials p and q, such that p(A) = ZN and |q(A)| < ε N, where p(A) is the set \p(a1, a2, …, an)..a1, a2, …, an ∈ A\, when p has n variables. In this paper, we give a partial answer to Nathanson's question. For every k ∈ N and ε > 0, we find a set A ⊂ ZN for suitable N, such that A- A = ZN, but |A2 + kA| < ε N, where A2 + kA = \a1a2 + b1 + b2 + … + bk..a1, a2,b1, …, bk ∈ A\. We also extend this result to construct, for every k ∈ N and ε > 0, a set A ⊂ ZN for suitable N, such that A- A = ZN, but |3A2 + kA| < ε N, where 3A2 + kA = \a1a2 + a3a4 + a5a6 + b1 + b2 + … + bk..a1, …, a6,b1, …, bk ∈ A\.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…