相关论文: Long Arithmetic Progressions in Critical Sets

For a prime $p$, a restricted arithmetic progression in $\mathbb{F}_p^n$ is a triplet of vectors $x, x+a, x+2a$ in which the common difference $a$ is a non-zero element from $\{0,1,2\}^n$. What is the size of the largest $A\subseteq…

Let H be a Krull monoid with finite class group G and suppose that every class contains a prime divisor. Then sets of lengths in H have a well-defined structure which just depends on the class group G. With methods from additive…

We prove a generalization of the author's work to show that any subset of the primes which is `well-distributed' in arithmetic progressions contains many primes which are close together. Moreover, our bounds hold with some uniformity in the…

We prove new lower bounds on the maximum size of sets $A\subseteq \mathbb{F}_p^n$ or $A\subseteq \mathbb{Z}_m^n$ not containing three-term arithmetic progressions (consisting of three distinct points). More specifically, we prove that for…

Let S be an infinite set of non-empty, finite subsets of the nonnegative integers. If p is an odd prime, let c(p) denote the cardinality of the set {T {\in} S : T {\subseteq} {1,...,p-1} and T is a set of quadratic residues (respectively,…

A celebrated and deep result of Green and Tao states that the primes contain arbitrarily long arithmetic progressions. In this note I provide a straightforward argument demonstrating that the primes get arbitrarily close to arbitrarily long…

Let $m\geq 3$. Suppose that $$ 1-2^{-2^{m^24^m}}<\gamma<1. $$ Then the set $$ \{p\text{ prime}:\, p=[n^{\frac1\gamma}]\text{ for some }n\in{\mathbb N}\} $$ contains infinitely many non-trivial $m$-term arithmetic progressions.

We prove that if $A\subset \{1,\dots,N\}$ has no nontrivial three-term arithmetic progressions, then $|A|\leq \exp(-c\log(N)^{1/6}\log\log(N)^{-1})N$ for some absolute constant $c>0$. To obtain this bound, we use an iterated variant of the…

We show that there exists pairs of consecutive primes less than $x$ whose difference is larger than $t(1+o(1))(\log{x})(\log\log{x})(\log\log\log\log{x})(\log\log\log{x})^{-2}$ for any fixed $t$. Our proof works by incorporating recent…

We prove that if $A\subseteq \{1,\dots,N\}$ does not contain any non-trivial three-term arithmetic progression, then $$|A|\ll \frac{(\log\log N)^{3+o(1)}}{\log N}N\,.$$

It is known that if a subset of $\mathbb{R}$ has positive Lebesgue measure, then it contains arbitrarily long finite arithmetic progressions. We prove that this result does not extend to infinite arithmetic progressions in the following…

In the present paper we prove that there exist infinitely many arithmetic progressions of three different primes $p_1,p_2,p_3=2p_2-p_1$ such that $p_1=x_1^2 + y_1^2 +1$, $p_2=x_2^2 + y_2^2 +1$.

In this paper, we prove several results on the structure of maximal sets $S \subseteq [N]$ such that $S$ mod $p$ is contained in a short arithmetic progression, or the union of short progressions, where $p$ ranges over a subset of primes in…

For an integer $b \geqslant 2$ and a set $S\subset \{0,\cdots,b-1\}$, we define the Kempner set $\mathcal{K}(S,b)$ to be the set of all non-negative integers whose base-$b$ digital expansions contain only digits from $S$. These well-studied…

Suppose that A is a subset of the integers {1,...,N} of density a. We provide a new proof of a result of Green which shows that A+A contains an arithmetic progression of length exp(ca(log N)^{1/2}) for some absolute c>0. Furthermore we…

An overview of the results of new exhaustive computations of gaps between primes in arithmetic progressions is presented. We also give new numerical results for exceptionally large least primes in arithmetic progressions.

Furstenberg, Glasscock, Bergelson, Beiglboeck have been studied abundance in arithmatic progression on various large sets like piecewise syndetic, central, thick, etc. but also there are so many sets in which abundance in progression is…

This note discusses the existence of prime numbers in short intervals. An unconditional elementary argument seems to prove the existence of primes in the short intervals [x, x + y], where y >= x^(1/2)(log x)^e, e > 0, and a sufficiently…

Fix a prime p and a density 0 < d <= 1. Among all functions f : F_p -> [0,1], what can one say about those which assign minimal weight to three-term arithmetic progressions -- that is, the sum of f(a)f(a+x)f(a+2x) is minimal as we sum over…

We prove a generalisation of Roth's theorem for arithmetic progressions to d-configurations, which are sets of the form {n_i+n_j+a}_{1 \leq i \leq j \leq d} where a, n_1,..., n_d are nonnegative integers, using Roth's original density…