June 27, 2020
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 detail, drawing on a variety of tools from algebraic geometry.
Similar papers 1
April 20, 2015
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 \...
October 8, 2018
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-...
September 1, 2019
Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be polynomials with distinct degrees, each having zero constant term. We show that any subset $A$ of $\{1,\dots,N\}$ with no nontrivial progressions of the form $x,x+P_1(y),\dots,x+P_m(y)$ has size $|A|\ll N/(\log\log{N})^{c_{P_1,\dots,P_m}}$. Along the way, we prove a general result controlling weighted counts of polynomial progressions by Gowers norms.
May 24, 2017
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...
May 1, 2024
We establish upper bounds on the size of the largest subset of $\{1,2,\dots,N\}$ lacking nonzero differences of the form $h(p_1,\dots,p_{\ell})$, where $h\in \mathbb{Z}[x_1,\dots,x_{\ell}]$ is a fixed polynomial satisfying appropriate conditions and $p_1,\dots,p_{\ell}$ are prime. The bounds are of the same type as the best-known analogs for unrestricted integer inputs, due to Bloom-Maynard and Arala for $\ell=1$, and to the authors for $\ell \geq 2$.
December 6, 2016
We show that if $h\in \mathbb{Z}[x]$ is a polynomial of degree $k \geq 2$ such that $h(\mathbb{N})$ contains a multiple of $q$ for every $q\in \mathbb{N}$, known as an $\textit{intersective polynomial}$, then any subset of $\{1,2,\dots,N\}$ with no nonzero differences of the form $h(n)$ for $n\in\mathbb{N}$ has density at most a constant depending on $h$ and $c$ times $(\log N)^{-c\log\log\log\log N}$, for any $c<(\log((k^2+k)/2))^{-1}$. Bounds of this type were previously kn...
March 6, 2023
We show that if $h\in\mathbb{Z}[x]$ is a polynomial of degree $k$ such that the congruence $h(x)\equiv0\pmod{q}$ has a solution for every positive integer $q$, then any subset of $\{1,2,\ldots,N\}$ with no two distinct elements with difference of the form $h(n)$, with $n$ positive integer, has density at most $(\log N)^{-c\log\log\log N}$, for some constant $c$ that depends only on $k$. This improves on the best bound in the literature, due to Rice, and generalizes a recent r...
July 20, 1998
We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have no large prime factors) a positive proportion of the time. Although some results exist that bound the number of smooth values of a polynomial from above, a corresponding lower bound of the correct order of magnitude has hitherto been established only in a few special cases. The purpose of this paper is to provide such a lower bound for an arbitrary polynomial. Various generaliza...
August 16, 2019
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...
January 22, 2023
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.