Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Small Sets with Large Difference Sets (1705.08760v1)

Published 24 May 2017 in math.CO

Abstract: For every $\epsilon > 0$ and $k \in \mathbb{N}$, Haight constructed a set $A \subset \mathbb{Z}_N$ ($\mathbb{Z}_N$ stands for the integers modulo $N$) for a suitable $N$, such that $A-A = \mathbb{Z}_N$ and $|kA| < \epsilon N$. Recently, Nathanson posed the problem of constructing sets $A \subset \mathbb{Z}_N$ for given polynomials $p$ and $q$, such that $p(A) = \mathbb{Z}_N$ and $|q(A)| < \epsilon N$, where $p(A)$ is the set ${p(a_1, a_2, \dots, a_n)\phantom{.}\colon\phantom{.}a_1, a_2, \dots, a_n \in A}$, when $p$ has $n$ variables. In this paper, we give a partial answer to Nathanson's question. For every $k \in \mathbb{N}$ and $\epsilon > 0$, we find a set $A \subset \mathbb{Z}_N$ for suitable $N$, such that $A- A = \mathbb{Z}_N$, but $|A2 + kA| < \epsilon N$, where $A2 + 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 $k \in \mathbb{N}$ and $\epsilon > 0$, a set $A \subset \mathbb{Z}_N$ for suitable $N$, such that $A- A = \mathbb{Z}_N$, but $|3A2 + kA| < \epsilon N$, where $3A2 + 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}$.

Summary

We haven't generated a summary for this paper yet.