English
Related papers

Related papers: Difference sets and power residues

200 papers

Update: This work reproduces an earlier result of Peck, which the author was initially unaware of. The method of the proof is essentially the same as the original work of Peck. There are no new results. We show that the sum of squares of…

Number Theory · Mathematics 2012-11-07 J. Maynard

Suppose that P is an infinite set of primes such that P = A + B + C, where A,B,C are sets with at least two elements. We show that if P(x) > c x/log^d x (where P(x) = the number of elements of P that are <= x), and if A,B,C is a "regular"…

Number Theory · Mathematics 2007-05-23 Ernie Croot , Christian Elsholtz

We compare the size of the difference set $A-A$ to that of the set $kA$ of $k$-fold sums. We show the existence of sets such that $|kA| < |A-A|^{a_k}$ with $a_k<1$.

Number Theory · Mathematics 2016-01-19 Imre Z. Ruzsa

We show that for every $0 < \epsilon \leq 1$ and integer $k\geq 1$, there exists an integer $n = n(\epsilon,k)$ so that for all primes $p$, and integers $0 \leq a \leq p-1$, there exist integers $1 \leq x_1 < ... < x_n \leq p^\epsilon$ such…

Number Theory · Mathematics 2007-05-23 Ernie Croot

Let $w(n)$ be an additive non-negative integer-valued arithmetic function which is equal to $1$ on primes. We study the distribution of $n + w(n)$ $\pmod p$ and give a lower bound for the density of the set of numbers which are not…

Number Theory · Mathematics 2022-11-29 Petr Kucheriaviy

The $3k-4$ Theorem asserts that, if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with $|A|\geq |B|$ and $|A+B|=|A|+|B|+r< |A|+2|B|-3$, then there are arithmetic progressions $P_A$ and $P_B$ of common difference with $X\subseteq…

Number Theory · Mathematics 2024-02-26 David J. Grynkiewicz

Let $K$ be a number field and $S$ a finite set of places of $K$ that contains all of the archimedean places. Let $\varphi: \mathbb{P}^1 \to \mathbb{P}^1$ be a rational map of degree $d \geq 2$ defined over $K$. Given $\alpha \in…

Number Theory · Mathematics 2026-01-30 Jit Wu Yap

Given a subset of real numbers $A$ with small product $AA$ we obtain a new upper bound for the additive energy of $A$. The proof uses a natural observation that level sets of convolutions of the characteristic function of $A$ have small…

Combinatorics · Mathematics 2019-11-28 Konstantin I. Olmezov , Aliaksei S. Semchankau , Ilya D. Shkredov

Let $K: \boldsymbol{\Omega}\times \boldsymbol{\Omega}$ be a continuous Mercer kernel defined on a compact subset of ${\mathbb R}^n$ and $\mathcal{H}_K$ be the reproducing kernel Hilbert space (RKHS) associated with $K$. Given a finite…

Machine Learning · Statistics 2024-12-31 Rustem Takhanov

On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.

Number Theory · Mathematics 2015-10-06 Adrian Dudek , Loïc Grenié , Giuseppe Molteni

We prove, that $$ \biggl\|\biggl(\frac43\biggr)^k\biggr\| >\biggl(\frac49\biggr)^k\qquad\text{for}\quad k\ge6, $$ where $\|\cdot\|$ is a distance to the nearest prime.

Number Theory · Mathematics 2014-06-27 Yury Pupyrev

Let $c$ be a positive odd integer and $R$ a set of $n$ primes coprime with $c$. We consider equations $X + Y = c^z$ in three integer unknowns $X$, $Y$, $z$, where $z > 0$, $Y > X > 0$, and the primes dividing $XY$ are precisely those in…

Number Theory · Mathematics 2023-01-24 Reese Scott , Robert Styer

For $k\geq3$, a collection of $k$ sets is said to form a \emph{weak $\Delta$-system} if the intersection of any two sets from the collection has the same size. Erd\H{o}s and Szemer\'{e}di asked about the size of the largest family…

Combinatorics · Mathematics 2023-01-24 Eric Naslund

We introduce a variant of the large sieve and give an example of its use in a sieving problem. Take the interval [N] = {1,...,N} and, for each odd prime p <= N^{1/2}, remove or ``sieve out'' by all n whose reduction mod p lies in some…

Number Theory · Mathematics 2008-08-01 Ben Green

Let $p_n$ denotes the $n$-th prime. We prove that $$\max_{p_{n+1} \leq X} (p_{n+1}-p_n) \gg \frac{\log X \log \log X\log\log\log\log X}{\log \log \log X}$$ for sufficiently large $X$, improving upon recent bounds of the first three and…

Number Theory · Mathematics 2019-10-22 Kevin Ford , Ben Green , Sergei Konyagin , James Maynard , Terence Tao

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Combinatorics · Mathematics 2016-11-22 Bernardo Abrego , Silvia Fernandez-Merchant , Daniel J. Katz , Levon Kolesnikov

The main result of this paper is the following: for all $b \in \mathbb Z$ there exists $k=k(b)$ such that \[ \max \{ |A^{(k)}|, |(A+u)^{(k)}| \} \geq |A|^b, \] for any finite $A \subset \mathbb Q$ and any non-zero $u \in \mathbb Q$. Here,…

Number Theory · Mathematics 2020-09-22 Brandon Hanson , Oliver Roche-Newton , Dmitrii Zhelezov

Let G=SL_3(Z/pZ), p a prime. Let A be a set of generators of G. Then A grows under the group operation. To be precise: denote by |S| the number of elements of a finite set S. Assume |A| < |G|^{1-\epsilon} for some \epsilon>0. Then |A\cdot…

Group Theory · Mathematics 2009-06-08 H. A. Helfgott

Let p be a prime number. Let G be a finite abelian p-group of exponent n (written additively) and A be a non-empty subset of $]n[:= \{1,2,..., n\}$ such that elements of A are incongruent modulo p and non-zero modulo p. Let $k \geq…

Number Theory · Mathematics 2007-07-16 R Thangadurai

We derive various sharp upper bounds for the $p$-capacity of a smooth compact set $K$ in the hyperbolic space $\mathbb{H}^n$ and the Euclidean space $\mathbb{R}^n$. Firstly, using the inverse mean curvature flow, for the mean convex and…

Differential Geometry · Mathematics 2023-06-16 Haizhong Li , Ruixuan Li , Changwei Xiong