On product of difference sets for sets of positive density

Let $a_0=b_0=0$ and $0<a_1\leq b_1<a_2\leq b_2<\ldots\leq b_{n}$ be integers. Let $Q\left(x;\bigcup_{j=1}^{n}[a_j,b_j]\right)$ be the number of integers between $1$ and $x$ such that all exponents in their prime factorization are in $\bigcup_{j=1}^{n}[a_j,b_j]$. The following formula holds: $$\lim_{x\to\infty}{\frac{Q\left(x;\bigcup_{j=1}^{n}[a_j,b_j]\right)}{x}}=\prod\limits_{p}\sum\limits_{i=0}^{n}\left(\frac{1}{p^{a_{i}}}-\frac{1}{p^{b_{i}+1}}\right).$$ In this paper, we p...

Motivated by a question of S\'ark\"ozy, we study the gaps in the product sequence $\B=\A ... \A=\{b_n=a_ia_j, a_i,a_j\in \A\}$ when $\A$ has upper Banach density $\alpha>0$. We prove that there are infinitely many gaps $b_{n+1}-b_n\ll \alpha^{-3}$ and that for $t\ge2$ there are infinitely many $t$-gaps $b_{n+t}-b_{n}\ll t^2\alpha^{-4}$. Furthermore we prove that these estimates are best possible. We also discuss a related question about the cardinality of the quotient set $...

Two sets of nonnegative integers $A=\{a_1<a_2<\cdots\}$ and $B=\{b_1<b_2<\cdots\}$ are defined as \emph{disjoint}, if $\{A-A\}\bigcap\{B-B\}=\{0\}$, namely, the equation $a_i+b_t=a_j+b_k$ has only trivial solution. In 1984, Erd\H os and Freud [J. Number Theory 18 (1984), 99-109.] constructed disjoint sets $A,B$ with $A(x)>\varepsilon\sqrt{x}$ and $B(x)>\varepsilon\sqrt{x}$ for some $\varepsilon>0$, which answered a problem posed by Erd\H os and Graham. In this paper, followin...

We prove that the size of the product set of any finite arithmetic progression $\mathcal{A}\subset \mathbb{Z}$ satisfies \[|\mathcal A \cdot \mathcal A| \ge \frac{|\mathcal A|^2}{(\log |\mathcal A|)^{2\theta +o(1)} } ,\] where $2\theta=1-(1+\log\log 2)/(\log 2)$ is the constant appearing in the celebrated Erd\H{o}s multiplication table problem. This confirms a conjecture of Elekes and Ruzsa from about two decades ago. If instead $\mathcal{A}$ is relaxed to be a subset of ...

We prove that for any finite set A of real numbers its difference set D:=A-A has large product set and quotient set, namely, |DD|, |D/D| \gg |D|^{1+c}, where c>0 is an absolute constant. A similar result takes place in the prime field F_p for sufficiently small D. It gives, in particular, that multiplicative subgroups of size less than p^{4/5-\eps} cannot be represented in the form A-A for any A from F_p.

Let \psi(x) be a polynomial with rational coefficients. Suppose that \psi has the positive leading coefficient and zero constant term. Let A be a set of positive integers with the positive upper density. Then there exist x,y\in A and a prime p such that x-y=\psi(p-1). Furthermore, if P be a set of primes with the positive relative upper density, then there exist x,y\in P and a prime p such that x-y=\psi(p-1).

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 \...

We determine the asymptotic density $\delta_k$ of the set of ordered $k$-tuples $(n_1,...,n_k)\in \N^k, k\ge 2$, such that there exists no prime power $p^a$, $a\ge 1$, appearing in the canonical factorization of each $n_i$, $1\le i\le k$, and deduce asymptotic formulae with error terms regarding this problem and analogous ones. We give numerical approximations of the constants $\delta_k$ and improve the error term of formula (1.2) due to {\sc E. Cohen}. We point out that ou...

Let $\mathrm{d}(A)$ be the asymptotic density (if it exists) of a sequence of integers $A$. For any real numbers $0\leq\alpha\leq\beta\leq 1$, we solve the question of the existence of a sequence $A$ of positive integers such that $\mathrm{d}(A)=\alpha$ and $\mathrm{d}(A+A)=\beta$. More generally we study the set of $k$-tuples $(\mathrm{d}(iA))_{1\leq i\leq k}$ for $A\subset \mathbb{N}$. This leads us to introduce subsets defined by diophantine constraints inside a random set...

In this note we prove that for every sequence $(m_q)_{q}$ of positive integers and for every real $0<\delta\leqslant1$ there is a sequence $(n_q)_{q}$ of positive integers such that for every sequence $(H_q)_{q}$ of finite sets such that $|H_q|=n_q$ for every $q\in\mathbb{N}$ and for every $D\subseteq \bigcup_k\prod_{q=0}^{k-1}H_q$ with the property that $$\limsup_k \frac{|D\cap \prod_{q=0}^{k-1} H_q|}{|\prod_{q=0}^{k-1}H_q|}\geqslant\delta$$ there is a sequence $(J_q)_{q}$, ...