ID: 1705.08760

Small Sets with Large Difference Sets

May 24, 2017

View on ArXiv
Luka Milicevic
Mathematics
Combinatorics

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 $|A^2 + kA| < \epsilon N$, where $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 $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 $|3A^2 + kA| < \epsilon N$, where $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\}$.

Similar papers 1

Multivariate Polynomial Values in Difference Sets

June 27, 2020

87% Match
John R. Doyle, Alex Rice
Number Theory
Algebraic Geometry
Combinatorics

For $\ell\geq 2$ and $h\in \mathbb{Z}[x_1,\dots,x_{\ell}]$ of degree $k\geq 2$, we show that every set $A\subseteq \{1,2,\dots,N\}$ lacking nonzero differences in $h(\mathbb{Z}^{\ell})$ satisfies $|A|\ll_h Ne^{-c(\log N)^{\mu}}$, where $c=c(h)>0$, $\mu=[(k-1)^2+1]^{-1}$ if $\ell=2$, and $\mu=1/2$ if $\ell\geq 3$, provided $h(\mathbb{Z}^{\ell})$ contains a multiple of every natural number and $h$ satisfies certain nonsingularity conditions. We also explore these conditions in ...

Find SimilarView on arXiv

The Haight-Ruzsa method for sets with more differences than multiple sums

April 11, 2016

86% Match
Melvyn B. Nathanson
Number Theory

Let $h$ be a positive integer and let $\varepsilon > 0$. The Haight-Ruzsa method produces a positive integer $m^*$ and a subset $A$ of the additive abelian group $\mathbf{Z}/m^*\mathbf{Z}$ such that the difference set is large in the sense that $A-A = \mathbf{Z}/m^*\mathbf{Z}$ and $h$-fold sumset is small in the sense that $|hA| < \varepsilon m^*$. This note describes, and in a modest way extends, the Haight-Ruzsa argument, and constructs sets with more differences than multi...

Find SimilarView on arXiv
Ilya D. Shkredov
Number Theory
Combinatorics

In our paper we study multiplicative properties of difference sets $A-A$ for large sets $A \subseteq \mathbb{Z}/q\mathbb{Z}$ in the case of composite $q$. We obtain a quantitative version of a result of A. Fish about the structure of the product sets $(A-A)(A-A)$. Also, we show that the multiplicative covering number of any difference set is always small.

Lower bounds in the polynomial Szemer\'edi theorem

August 16, 2019

86% Match
Khalid Younis
Number Theory
Combinatorics

We construct large subsets of the first $N$ positive integers which avoid certain arithmetic configurations. In particular, we construct a set of order $N^{0.7685}$ lacking the configuration $\{x,x+y,x+y^2\},$ surpassing the $N^{3/4}$ limit of Ruzsa's construction for sets lacking a square difference. We also extend Ruzsa's construction to sets lacking polynomial differences for a wide class of univariate polynomials. Finally, we turn to multivariate differences, constructing...

Find SimilarView on arXiv

Difference Sets and Polynomials

April 20, 2015

85% Match
Neil Lyall, Alex Rice
Number Theory
Classical Analysis and ODEs
Combinatorics

We provide upper bounds on the largest subsets of $\{1,2,\dots,N\}$ with no differences of the form $h_1(n_1)+\cdots+h_{\ell}(n_{\ell})$ with $n_i\in \mathbb{N}$ or $h_1(p_1)+\cdots+h_{\ell}(p_{\ell})$ with $p_i$ prime, where $h_i\in \mathbb{Z}[x]$ lie in in the classes of so-called intersective and $\mathcal{P}$-intersective polynomials, respectively. For example, we show that a subset of $\{1,2,\dots,N\}$ free of nonzero differences of the form $n^j+m^k$ for fixed $j,k\in \...

Find SimilarView on arXiv

Note on a problem of Nathanson related to the $\varphi$-Sidon set

November 30, 2021

85% Match
Csaba Sándor, Quan-Hui Yang, Jun-Yu Zhou
Number Theory

Let $\varphi (x_{1}, \ldots, x_{h})=c_{1} x_{1}+\cdots+c_{h} x_{h}$ be a linear form with coefficients in a field $\mathbf{F}$, and let $V$ be a vector space over $\mathbf{F}$. A nonempty subset $A$ of $V$ is a $\varphi$-Sidon set if $\varphi\left(a_{1}, \ldots, a_{h}\right)=\varphi\left(a_{1}^{\prime}, \ldots, a_{h}^{\prime}\right)$ implies $\left(a_{1}, \ldots, a_{h}\right)=$ $\left(a_{1}^{\prime}, \ldots, a_{h}^{\prime}\right)$ for all $h$-tuples $\left(a_{1}, \ldots, a_{h...

Find SimilarView on arXiv

Products of Differences over Arbitrary Finite Fields

May 18, 2017

85% Match
Brendan Murphy, Giorgis Petridis
Combinatorics
Number Theory

There exists an absolute constant $\delta > 0$ such that for all $q$ and all subsets $A \subseteq \mathbb{F}_q$ of the finite field with $q$ elements, if $|A| > q^{2/3 - \delta}$, then \[ |(A-A)(A-A)| = |\{ (a -b) (c-d) : a,b,c,d \in A\}| > \frac{q}{2}. \] Any $\delta < 1/13,542$ suffices for sufficiently large $q$. This improves the condition $|A| > q^{2/3}$, due to Bennett, Hart, Iosevich, Pakianathan, and Rudnev, that is typical for such questions. Our proof is based on ...

Find SimilarView on arXiv

Binary Quadratic Forms in Difference Sets

October 8, 2018

84% Match
Alex Rice
Number Theory
Classical Analysis and ODEs
Combinatorics

We show that if $h(x,y)=ax^2+bxy+cy^2\in \mathbb{Z}[x,y]$ satisfies $\Delta(h)=b^2-4ac\neq 0$, then any subset of $\{1,2,\dots,N\}$ lacking nonzero differences in the image of $h$ has size at most a constant depending on $h$ times $N\exp(-c\sqrt{\log N})$, where $c=c(h)>0$. We achieve this goal by adapting an $L^2$ density increment strategy previously used to establish analogous results for sums of one or more single-variable polynomials. Our exposition is thorough and self-...

Find SimilarView on arXiv

Counting polynomial subset sums

July 22, 2015

84% Match
Jiyou Li, Daqing Wan
Number Theory
Combinatorics

Let $D$ be a subset of a finite commutative ring $R$ with identity. Let $f(x)\in R[x]$ be a polynomial of positive degree $d$. For integer $0\leq k \leq |D|$, we study the number $N_f(D,k,b)$ of $k$-subsets $S\subseteq D$ such that \begin{align*} \sum_{x\in S} f(x)=b. \end{align*} In this paper, we establish several asymptotic formulas for $N_f(D,k, b)$, depending on the nature of the ring $R$ and $f$. For $R=\mathbb{Z}_n$, let $p=p(n)$ be the smallest prime divisor o...

Find SimilarView on arXiv

Low-complexity approximations for sets defined by generalizations of affine conditions

June 1, 2023

83% Match
W. T. Gowers, Thomas Karam
Combinatorics
Group Theory
Number Theory

Let $p$ be a prime, let $S$ be a non-empty subset of $\mathbb{F}_p$ and let $0<\epsilon\leq 1$. We show that there exists a constant $C=C(p, \epsilon)$ such that for every positive integer $k$, whenever $\phi_1, \dots, \phi_k: \mathbb{F}_p^n \rightarrow \mathbb{F}_p$ are linear forms and $E_1, \dots, E_k$ are subsets of $\mathbb{F}_p$, there exist linear forms $\psi_1, \dots, \psi_C: \mathbb{F}_p^n \rightarrow \mathbb{F}_p$ and subsets $F_1, \dots, F_C$ of $\mathbb{F}_p$ such...

Find SimilarView on arXiv