Related papers: Arithmetic structures in random sets

Many fundamental questions in additive number theory (such as Goldbach's conjecture, Fermat's last theorem, and the Twin Primes conjecture) can be expressed in the language of sum and difference sets. As a typical pair of elements…

We make explicit Bombieri's refinement of Gallagher's log-free "large sieve density estimate near $\sigma = 1$" for Dirichlet $L$-functions. We use this estimate and recent work of Green to prove that if $N\geq 2$ is an integer,…

In this paper, we strengthen a result by Green about an analogue of Sarkozy's theorem in the setting of polynomial rings $\mathbb{F}_q[x]$. In the integer setting, for a given polynomial $F \in \mathbb{Z}[x]$ with constant term zero, (a…

For any set $A$ of natural numbers with positive upper Banach density and any $k\geq 1$, we show the existence of an infinite set $B\subset{\mathbb N}$ and a shift $t\geq0$ such that $A-t$ contains all sums of $m$ distinct elements from $B$…

We show that a random set of integers with density 0 has almost always more differences than sums. This proves a conjecture by Martin and O'Bryant.

Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…

We consider the four structures $(\mathbb{Z}; \mathrm{Sqf}^\mathbb{Z})$, $(\mathbb{Z}; <, \mathrm{Sqf}^\mathbb{Z})$, $(\mathbb{Q}; \mathrm{Sqf}^\mathbb{Q})$, and $(\mathbb{Q}; <, \mathrm{Sqf}^\mathbb{Q})$ where $\mathbb{Z}$ is the additive…

We prove a quantitative version of the Polynomial Szemeredi Theorem for difference sets. This result is achieved by first establishing a higher dimensional analogue of a theorem of Sarkozy (the simplest non-trivial case of the Polynomial…

In this paper we extend some set theoretic concepts of numerical semigroups for arbitrary sub-semigroups of natural numbers. Then we characterized gapsets which leads to a more efficient computational approach towards numerical semigroups…

We explore the properties of non-piecewise syndetic sets with positive upper density, which we call "discordant", in countably infinite amenable (semi)groups. Sets of this kind are involved in many questions of Ramsey theory and manifest…

In this paper, we prove a structure theorem for the infinite union of $n$-adic doubling measures via techniques which involve far numbers. Our approach extends the results of Wu in 1998, and as a by product, we also prove a classification…

We give a short proof of a sumset conjecture of Erd\"os, recently proved by Moreira, Richter and Robertson: every subset of the integers of positive density contains the sum of two infinite sets. The proof is written in the framework of…

We investigate the occurrence of additive and multiplicative structures in random subsets of the natural numbers. Specifically, for a Bernoulli random subset of $\mathbb{N}$ where each integer is included independently with probability…

The sumset is one of the most basic and central objects in additive number theory. Many of the most important problems (such as Goldbach's conjecture and Fermat's Last theorem) can be formulated in terms of the sumset $S + S = \{x+y :…

In this article we describe all possible infinite linear configurations that can be found in a shift of any set of positive upper Banach density. This simultaneously generalizes Szemer\'edi's theorem on arithmetic progressions and the…

We study the asymptotic distribution of integers sharing the same rooted-tree structure that encodes their complete prime factorization tower. For each tree we derive an explicit density formula depending only on a pair $(m,k)$, the density…

We introduce a new probabilistic technique for finding 'almost-periods' of convolutions of subsets of groups. This gives results similar to the Bogolyubov-type estimates established by Fourier analysis on abelian groups but without the need…

The Furstenberg-S\'ark\"ozy theorem asserts that the difference set $E-E$ of a subset $E \subset \mathbb{N}$ with positive upper density intersects the image set of any polynomial $P \in \mathbb{Z}[n]$ for which $P(0)=0$. Furstenberg's…

We combine the fundamental results of Breuillard, Green, and Tao on the structure of approximate groups, together with "tame" arithmetic regularity methods based on work of the authors and Terry, to give a structure theorem for finite…

The problem of looking for subsets of the natural numbers which contain no 3-term arithmetic progressions has a rich history. Roth's theorem famously shows that any such subset cannot have positive upper density. In contrast, Rankin in 1960…