Ernie Croot
In this paper we prove: If 0 < d < 1, and p is a sufficiently large prime, then if S is a subset of Z/pZ having the least number of three-term arithmetic progressions among all subsets of Z/pZ having at least dp elements, then S has an arithmetic progression of length at least log^{1/4+o(1)} x.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We improve the quantitative estimate for Roth's theorem on three-term arithmetic progressions, showing that if $A\subset\{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert\ll N(\log\log N)^4/\log N$. By the same method we also improve the bounds in the analogous problem over $\mathbb{F}_q[t]$ and for the problem of finding long arithmetic progressions in a sumset.
We show that if $A\subset \{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert \ll N/(\log N)^{1+c}$ for some absolute constant $c>0$. In particular, this proves the first non-trivial case of a conjecture of Erdős on arithmetic progressions.
We prove that if one has k non-intersecting arithmetic progressions of integers, with common differences 2 <= q_1,...,q_k <= x, then k < x exp((-1/6 + o(1)) sqrt(log x loglog x)). This improves a result of Szemeredi and Erdos.
We construct subsets of {1,...,N} of cardinality at least N exp(-C(log N)^{1/(k+1)}) which do not contain arithmetic progressions of length 2^k+1. This extends a result of Behrend (1946) concerning sets which do not contain aritmetic progressions of length 3.
Integer Sets of Large Harmonic Sum Which Avoid Long Arithmetic Progressions
本研究给出数字受限整数集不含k项算术级数的条件，通过大规模搜索找到不含4项与10项算术级数且调和和优于传统贪心构造的整数集，可高效计算相关集合与调和和。
We present an elementary proof that if $A$ is a finite set of numbers, and the sumset $A+_GA$ is small, $|A+_GA|\leq c|A|$, along a dense graph $G$, then $A$ contains $k$-term arithmetic progressions.
We consider the problem of determining the maximum cardinality of a subset containing no arithmetic progressions of length $k$ in a given set of size $n$. It is proved that it is sufficient, in a certain sense, to consider the interval $[1,\dots, n]$. The study continues the work of Komlós, Sulyok, and Szemerédi.
We study arithmetic progressions in primes with common differences as small as possible. Tao and Ziegler showed that, for any $k \geq 3$ and $N$ large, there exist non-trivial $k$-term arithmetic progressions in (any positive density subset of) the primes up to $N$ with common difference $O((\log N)^{L_k})$, for an unspecified constant $L_k$. In this work we obtain this statement with the precise value $L_k = (k-1) 2^{k-2}$. This is achieved by proving a relative version of Szemerédi's theorem for narrow progressions requiring simpler pseudorandomness hypotheses in the spirit of recent work of…
Asymptotics of partition parts in arithmetic progressions
研究算术级数中分拆部分的分布，通过分析生成函数中的非模艾森斯坦级数，获得捕获所有指数增长项的新近结果。
We show that the hereditary discrepancy of homogeneous arithmetic progressions is lower bounded by $n^{1/O(\log \log n)}$. This bound is tight up to the constant in the exponent. Our lower bound goes via proving an exponential lower bound on the discrepancy of set systems of subcubes of the boolean cube $\{0, 1\}^d$.
Given two sets $\cA, \cB \subseteq \F_q$ of elements of the finite field $\F_q$ of $q$ elements, we show that the productset $$ \cA\cB = \{ab | a \in \cA, b \in\cB\} $$ contains an arithmetic progression of length $k \ge 3$ provided that $k<p$, where $p$ is the characteristic of $\F_q$, and $# \cA # \cB \ge 3q^{2d-2/k}$. We also consider geometric progressions in a shifted productset $\cA\cB +h$, for $f \in \F_q$, and obtain a similar result.
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 sparse sets provide a rich setting for additive number theory, and in this paper we study various questions relating to the appearance of arithmetic progressions in these sets. In particular, for all $b$ we determine exactly the maximal length of an arithmetic progression that omits a base-$b$ digit.
We show that if a finite, large enough subset A of an arbitrary abelian group satisfies the small doubling condition |A + A| < (log |A|)^{1 - epsilon} |A|, then A must contain a three-term arithmetic progression whose terms are not all equal, and A + A must contain an arithmetic progression or a coset of a subgroup, either of which of size at least exp^[ c (log |A|)^{delta} ]. This extends analogous results obtained by Sanders and, respectively, by Croot, Laba and Sisask in the case where the group is that of the integers or a finite field.
We develop a theory of multiplicative functions (with values inside or on the unit circle) in arithmetic progressions analogous to the well-known theory of primes in arithmetic progressions.
Euler showed that there can be no more than three integer squares in arithmetic progression. In quadratic number fields, Xarles has shown that there can be arithmetic progressions of five squares, but not of six. Here, we prove that there are no cubic number fields which contain five squares in arithmetic progression.
We show that there exists a positive constant C such that the following holds: Given an infinite arithmetic progression A of real numbers and a sufficiently large integer n (depending on A), there needs at least Cn geometric progressions to cover the first n terms of A. A similar result is presented, with the role of arithmetic and geometric progressions reversed.
Green and Tao proved that the primes contains arbitrarily long arithmetic progressions. We show that, essentially the same proof leads to the following result: The primes in an short interval contains many arithmetic progressions of any given length.
In this paper we continue the investigations about unlike powers in arithmetic progression. We provide sharp upper bounds for the length of primitive non-constant arithmetic progressions consisting of squares/cubes and $n$-th powers.
We show the middle Nth cantor set contains arithmetic progressions of length at least proportional to N/log_2(N).
We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic progressions is also given.
Large gaps between primes in arithmetic progressions -- an empirical approach
本文概述了算术级数中素数间间隙的全新穷举计算结果，并给出了异常大的最小素数的新数值结果。
We establish Bombieri-Vinogradov's type result for the number of solutions of the ternary Goldbach problem with primes from arithmetic progressions.
In this paper, we improve the error term in a previous paper on an asymptotic formula for the number of squarefull numbers in an arithmetic progression.
In this paper we improve the estimate for the remainder term in the asymptotic formula concerning the circle problem in an arithmetic progression.
In this paper, we give a new upper bound of Barban-Davenport-Halberstam type for twins of $k-$free numbers in arithmetic progressions.
In this paper we investigate the recent advances by Zhang, Maynard and Pintz towards Polignac's conjecture and give some new results concerning the relationship between Polignac numbers and arithmetic progressions.
We investigate the approximation to the number of primes in arithmetic progressions given by Vaughan. Instead of averaging the expected error term over all residue classes to modules in a given range, here we only consider subsets of arithmetic progressions that satisfy additional congruence conditions and provide asymptotic approximations.
We prove a result on the distribution of the general divisor functions in arithmetic progressions to smooth moduli which exceed the square root of the length.
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\,.$$
We implement the Maynard-Tao method of detecting primes in tuples to investigate small gaps between primes in arithmetic progressions, with bounds that are uniform over a range of moduli.
This paper has been withdrawn
Let $γ<1<c$ and $19(c-1)+171(1-γ)<9$. In this paper, we establish an asymptotic formula for exponential sums over Piatetski-Shapiro primes $p=[n^{1/γ}]$ in arithmetic progressions.
In this paper we deal with composite rational functions having zeros and poles forming consecutive elements of an arithmetic progression. We also correct a result published earlier related to composite rational functions having a fixed number of zeros and poles.
We show that if besides the primes some other sequences (involving the Liouville function and the primes) have a common distribution level exceeding 0.7231 then for any positive even integer $h$ there are arbitrarily long arithmetic progressions of primes $p$ such that $p+h$ is also prime for each element of the progression. In case of $h=2$ this means that under some plausible unproved hypotheses about regular distribution of the primes and other sequences in arithmetic progressions we really have arbitrarily long arithmetic progressions in the sequence of twin primes.
The goal of this article is to study the discrepancy of the distribution of arithmetic sequences in arithmetic progressions. We will fix a sequence $\A=\{\a(n)\}_{n\geq 1}$ of non-negative real numbers in a certain class of arithmetic sequences. For a fixed integer $a\neq 0$, we will be interested in the behaviour of $\A$ over the arithmetic progressions $a \bmod q$, on average over $q$. Our main result is that for certain sequences of arithmetic interest, the value of $a$ has a significant influence on this distribution, even after removing the first term of the progressions.
We answer a number of questions of Erdős on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a variety of arithmetic constraints upon such progressions, under the assumption of the $abc$-conjecture of Masser and Oesterlé.
Let d be a squarefree integer. Does there exist four squares in arithmetic progression over Q(sqrt{d})? We shall give a partial answer to this question, depending on the value of d. In the affirmative case, we construct explicit arithmetic progressions consisting of four squares over Q(sqrt{d}).
We obtain an asymptotic formula, in the spirit of the Montgomery-Hooley refinement of the Barban-Davenport-Halberstam Theorem, for the variance associated with tuples of k-free numbers in arithmetic progressions.
In this paper we give a very elementary proof that if A and B are subsets of {1,2,...,N}, each having at least 5N^{1 - (4(k-1))^{-1}} elements, then the sumset A+B has a k-term arithmetic progression.
I show that a trivial modification of a standard proof of the Roth's Theorem on triples in arithmetic progression would lead to the following Theorem: If A is a "large set" that is its elements are monotone increasing integers and the sum of reciprocals of its elements diverges then the sequence contains an arithmetic progression of length three.
Mordell Curves with Ordinates in Arithmetic Progression
研究纵坐标成等差数列的莫德尔曲线，通过证明未被先前工作排除，给出特定长度的非同构曲线族，还构造适度秩椭圆曲线参数族，其子族有理点成等差数列。
In this short note, we give two proofs of the infinitude of primes via valuation theory and give a new proof of the divergence of the sum of prime reciprocals by Roth's theorem and Euler-Legendre's theorem for arithmetic progressions.
Assuming the Generalized Riemann Hypothesis, we obtain a lower bound within a constant factor of the conjectured asymptotic result for the second moment for primes in an individual arithmetic progression in short intervals. Previous results were averaged over all progression of a given modulus. The method uses a short divisor sum approximation for the von Mangoldt function, together with some new results for binary correlations of this divisor sum approximation in arithmetic progressions.
We find a lower bound for the number of Chen primes in the arithmetic progression $a \bmod q$, where $(a,q)=(a+2,q)=1$. Our estimate is uniform for $q \leq \log^M x$, where $M>0$ is fixed.
As the conclusion of a line of investigation undertaken in two previous papers, we compute asymptotic frequencies for the values taken by numerators of differences of consecutive Farey fractions with denominators restricted to lie in arithmetic progression.
An asymptotic formula for the variance of squarefree numbers in arithmetic progressions of given modulus was obtained by Nunes (see reference [3]). We improve one of the error terms.
We present an arithmetic progression of second numbers of length 28.
We prove an explicit error term for the $ψ(x,χ)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.
We give asymptotics for correlation sums linked with the distribution of squarefree numbers in arithmetic progressions over a fixed modulus. As a particular case we improve a result of Blomer concerning the variance.
We obtain an asymptotic formula for the second discrete moment of the Riemann zeta function over the arithmetic progression $\frac{1}{2} + in$. It shows that the first main term is equal to that of the continuous mean value.
We show estimates for the distribution of $k$-free numbers in short intervals and arithmetic progressions. We argue that, at least in certain ranges, these estimates agree with a conjecture by H. L. Montgomery.
In this paper, we study $k$-term arithmetic progressions $N, N+d, ..., N+(k-1)d$ of powerful numbers. Under the $abc$-conjecture, we obtain $d \gg_εN^{1/2 - ε}$. On the other hand, there exist infinitely many $3$-term arithmetic progressions of powerful numbers with $d \ll N^{1/2}$ unconditionally. We also prove some partial results when $k \ge 4$ and pose some open questions.
We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$, extending the Bombieri-Vinogradov theorem to moduli of size $x^{1/2+δ}$ which have conveniently sized divisors. The main feature of these estimates is that they are completely uniform with respect to the residue classes considered, unlike previous works on primes in arithmetic progressions to large moduli.
We study the upper tail of the number of arithmetic progressions of a given length in a random subset of {1,...,n}, establishing exponential bounds which are best possible up to constant factors in the exponent. The proof also extends to Schur triples, and, more generally, to the number of edges in random induced subhypergraphs of `almost linear' k-uniform hypergraphs.
We obtain the analog of the Bombieri-Vinogradov theorem for square moduli up to any power of x less than 1/2.
An Equivalent form of Twin Prime Conjecture connected with a sequence of arithmetic progressions
本文提出了一种与算术进展序列对称性质相关的 twin素数猜想等价形式。
We consider the reduction of an elliptic curve defined over the rational numbers modulo primes in a given arithmetic progression and investigate how often the subgroup of rational points of this reduced curve is cyclic as a special case of Serre's Cyclicity Conjecture.
We prove an upper bound for the length of an arithmetic progression represented by an irreducible integral binary quadratic form or a norm form, which depends only on the form and the progression's common difference. For quadratic forms, this improves significantly upon an earlier result of Dey and Thangadurai.
Average orders of Goldbach Estimates in Arithmetic Progressions
本文研究了算术级数中Goldbach表示的平均数问题，获得了渐近结果，并证明了该结果本质上是最佳的。
We study upper bounds for sums of Dirichlet characters. We prove a uniform upper bound of the character sum over all proper generalized arithmetic progressions, which generalizes the classical Polya and Vinogradov inequality. Our argument is based on getting an upper bound for the l1 norm of the Fourier coefficients of a generalized arithmetic progression. Our method also applies to give upper bounds for polynomial exponential sums.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。