ID: 1702.02544

On product of difference sets for sets of positive density

February 8, 2017

View on ArXiv
Alexander Fish
Mathematics
Dynamical Systems
Combinatorics
Number Theory

In this paper we prove that given two sets $E_1,E_2 \subset \mathbb{Z}$ of positive density, there exists $k \geq 1$ which is bounded by a number depending only on the densities of $E_1$ and $E_2$ such that $k\mathbb{Z} \subset (E_1-E_1)\cdot(E_2-E_2)$. As a corollary of the main theorem we deduce that if $\alpha,\beta > 0$ then there exist $N_0$ and $d_0$ which depend only on $\alpha$ and $\beta$ such that for every $N \geq N_0$ and $E_1,E_2 \subset \mathbb{Z}_N$ with $|E_1| \geq \alpha N, |E_2| \geq \beta N$ there exists $d \leq d_0$ a divisor of $N$ satisfying $d \, \mathbb{Z}_N \subset (E_1-E_1)\cdot(E_2-E_2)$.

Similar papers 1

Product of difference sets of set of primes

October 28, 2022

92% Match
Sayan Goswami
Number Theory
Combinatorics

In a recent work \cite{key-11}, A. Fish proved that if $E_{1}$ and $E_{2}$ are two subsets of $\mathbb{Z}$ of positive upper Banach density, then there exists $k\in\mathbb{Z}$ such that $k\cdot\mathbb{Z}\subset\left(E_{1}-E_{1}\right)\cdot\left(E_{2}-E_{2}\right).$ In this article we will show that a similar result is true for the set of primes $\mathbb{P}$ (which has density $0$). We will prove that there exists $k\in\mathbb{N}$ such that $k\cdot\mathbb{N}\subset\left(\mathb...

Find SimilarView on arXiv

A note on the natural density of product sets

June 23, 2020

89% Match
Sandro Bettin, Dimitris Koukoulopoulos, Carlo Sanna
Number Theory
Combinatorics

Given two sets of natural numbers $\mathcal{A}$ and $\mathcal{B}$ of natural density $1$ we prove that their product set $\mathcal{A}\cdot \mathcal{B}:=\{ab:a\in\mathcal{A},\,b\in\mathcal{B}\}$ also has natural density $1$. On the other hand, for any $\varepsilon>0$, we show there are sets $\mathcal{A}$ of density $>1-\varepsilon$ for which the product set $\mathcal{A}\cdot\mathcal{A}$ has density $<\varepsilon$. This answers two questions of Hegyv\'{a}ri, Hennecart and Pach.

Find SimilarView on arXiv

On the density of sumsets and product sets

February 7, 2019

88% Match
Norbert Hegyvári, François Hennecart, Péter Pál Pach
Number Theory
Combinatorics

In this paper some links between the density of a set of integers and the density of its sumset, product set and set of subset sums are presented.

Find SimilarView on arXiv

Product-free sets with high density

July 27, 2011

88% Match
Par Kurlberg, Jeffrey C. Lagarias, Carl Pomerance
Number Theory

We show that there are sets of integers with asymptotic density arbitrarily close to 1 in which there is no solution to the equation ab=c, with a,b,c in the set. We also consider some natural generalizations, as well as a specific numerical example of a product-free set of integers with asymptotic density greater than 1/2.

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.

Multiplicative bases and an Erd\H{o}s problem

February 22, 2016

87% Match
Péter Pál Pach, Csaba Sándor
Number Theory

In this paper we investigate how small the density of a multiplicative basis of order $h$ can be in $\{1,2,\dots,n\}$ and in $\mathbb{Z}^+$. Furthermore, a related problem of Erd\H os is also studied: How dense can a set of integers be, if none of them divides the product of $h$ others?

Find SimilarView on arXiv

The maximal density of product-free sets in Z/nZ

November 11, 2011

87% Match
Par Kurlberg, Jeffrey C. Lagarias, Carl Pomerance
Number Theory

This paper studies the maximal size of product-free sets in Z/nZ. These are sets of residues for which there is no solution to ab == c (mod n) with a,b,c in the set. In a previous paper we constructed an infinite sequence of integers (n_i)_{i > 0} and product-free sets S_i in Z/n_iZ such that the density |S_i|/n_i tends to 1 as i tends to infinity, where |S_i|$ denotes the cardinality of S_i. Here we obtain matching, up to constants, upper and lower bounds on the maximal atta...

Find SimilarView on arXiv

The number of rational numbers determined by large sets of integers

March 16, 2009

87% Match
Javier Cilleruelo, D. S. Ramana, Olivier Ramare
Number Theory

When $A$ and $B$ are subsets of the integers in $[1,X]$ and $[1,Y]$ respectively, with $|A| \geq \alpha X$ and $|B| \geq \beta X$, we show that the number of rational numbers expressible as $a/b$ with $(a,b)$ in $A \times B$ is $\gg (\alpha \beta)^{1+\epsilon}XY$ for any $\epsilon > 0$, where the implied constant depends on $\epsilon$ alone. We then construct examples that show that this bound cannot in general be improved to $\gg \alpha \beta XY$. We also resolve the natural...

Find SimilarView on arXiv

On sets of integers which are both sum-free and product-free

January 5, 2012

86% Match
Par Kurlberg, Jeffrey C. Lagarias, Carl Pomerance
Number Theory

We consider sets of positive integers containing no sum of two elements in the set and also no product of two elements. We show that the upper density of such a set is strictly smaller than 1/2 and that this is best possible. Further, we also find the maximal order for the density of such sets that are also periodic modulo some positive integer.

Find SimilarView on arXiv

A structure theorem for sets of small popular doubling

June 1, 2015

86% Match
Przemysław Mazur
Combinatorics

In this paper we prove that every set $A\subset\mathbb{Z}$ satisfying the inequality $\sum_{x}\min(1_A*1_A(x),t)\le(2+\delta)t|A|$ for $t$ and $\delta$ in suitable ranges, then $A$ must be very close to an arithmetic progression. We use this result to improve the estimates of Green and Morris for the probability that a random subset $A\subset\mathbb{N}$ satisfies $|\mathbb{N}\setminus(A+A)|\ge k$; specifically we show that $\mathbb{P}(|\mathbb{N}\setminus(A+A)|\ge k)=\Theta(2...

Find SimilarView on arXiv