Jeremy F Alm
In this paper, we give an algorithm for detecting non-trivial 3-APs in multiplicative subgroups of $\mathbb{F}_p^\times$ that is substantially more efficient than the naive approach. It follows that certain Var der Waerden-like numbers can be computed in polynomial time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Multiplicative functions 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.
Covering an arithmetic progression with geometric progressions and vice versa
我们证明了存在一个正常数C，使得如下成立：给定一个无穷大的实数等差数列A和一个足够大的整数n（取决于A），至少需要Cn个等比数列来覆盖A的前n项.一个类似的结果，与算术和等比数列的作用颠倒。
Arithmetic progressions of primes in short intervals
格林和陶证明了素数包含任意长的等差数列。我们表明，本质上相同的证明导致以下结果：在一个短的时间间隔的素数包含许多等差数列的任何给定的长度。
Arithmetic progressions of squares, cubes and $n$-th powers
本文继续对等差数列中的不等幂进行了研究。我们提供了尖锐的上界组成的平方/立方体和$n$次幂的原始非常数等差数列的长度。
We show the middle Nth cantor set contains arithmetic progressions of length at least proportional to N/log_2(N).
We show that smooth-supported multiplicative functions $f$ are well-distributed in arithmetic progressions $a_1a_2^{-1} \pmod q$ on average over moduli $q\leq x^{3/5-\varepsilon}$ with $(q,a_1a_2)=1$.
On Arithmetic Progressions in Recurrences - A new characterization of the Fibonacci sequence
证明了Fibonacci数列实质上是唯一的包含无穷多个三项等差数列的二元递归数列。本文还给出了一般线性递推式具有无穷多个三项等差数列的判别准则。
Large gaps between primes in arithmetic progressions -- an empirical approach
本文概述了算术级数中素数间间隙的全新穷举计算结果，并给出了异常大的最小素数的新数值结果。
The ternary Goldbach problem with primes from arithmetic progressions
利用等差数列建立了带素数的三元哥德巴赫问题的解的个数的Bschieri-Vinogradov型结果.
Squarefull numbers in arithmetic progression II
本文改进了前一篇关于等差数列中平方数的渐近公式的误差项。
On the remainder term in the circle problem in an arithmetic progression
本文改进了关于等差数列中圆问题的渐近公式中余项的估计。
On a variance for twins of $k-$free numbers in arithmetic progressions
本文给出了等差数列中$k-$自由数的孪生数的Barban-Davenport-Halbernut型的一个新的上界.
On Polignac's conjecture and arithmetic progressions
本文研究了Zhang，Maynard和Pintz关于Polignac猜想的最新进展，给出了Polignac数与等差数列之间关系的一些新结果.
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.
Let $G$ be a multiplicative subgroup of the prime field $\mathbb F_p$ of size $|G|> p^{1-κ}$ and $r$ an arbitrarily fixed positive integer. Assuming $κ=κ(r)>0$ and $p$ large enough, it is shown that any proportional subset $A\subset G$ contains non-trivial arithmetic progressions of length $r$. The main ingredient is the Szemerédi-Green-Tao theorem.
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.
Arbitrarily Long Arithmetic Progressions of Primes on the Nose
这篇论文已经被撤回了
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.
Pretentious multiplicative functions and the prime number theorem for 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.
Are there arbitrarily long arithmetic progressions in the sequence of twin primes? II
我们表明，如果除了素数的一些其他序列（包括刘维尔函数和素数）有一个共同的分布水平超过0.7231，然后为任何正偶数$h$有任意长的等差数列的素数$p$，使$p+h$也是素数的进展的每个元素。在$h=2$的情况下，这意味着，在关于素数和其他序列在等差数列中的规则分布的一些似是而非的未经证明的假设下，我们在孪生素数序列中真的有任意长的等差数列。
The influence of the first term of an arithmetic progression
本文的目的是研究等差数列中等差数列分布的差异性。我们将确定一类非负实数序列$\A=\{\a(n)\}_{n\geq 1}$为一类等差数列。对于一个固定的整数$a\neq 0$，我们感兴趣的是$\A$在等差数列$a \bmod q$上的行为，平均在$q$上的行为。我们的主要结果是，对于某些序列的算术兴趣，$a$的值有一个显着的影响，这种分布，即使在删除了首项的进展。
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é.
Arithmetic progressions of four squares over quadratic fields
设d是一个无平方因子的整数。Q（sqrt{d}）上的等差数列是否存在四个平方？我们将根据d的值对这个问题给出一个部分的答案。在肯定的情况下，我们构造由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.
k-term Arithmetic Progressions in Sumsets
本文给出了一个非常初等的证明：如果A和B是{1，2，…，N}，每个至少有5 N ^{1 -（4（k-1））^{-1}}个元素，则和集A+B有k项等差数列。
Short Note: Every Large Set of Integers Contains a Three Term Arithmetic Progression
我表明，一个平凡的修改标准证明罗斯定理的三倍在等差数列将导致以下定理：如果A是一个“大集合”，即它的元素是单调递增的整数和倒数的总和，其元素发散，然后序列包含一个等差数列的长度为3。
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.
On the second moment for primes in an arithmetic progression
在广义黎曼假设下，得到了在短区间内单个等差数列中素数的二阶矩的渐近解的一个常数因子内的下界.先前的结果在给定模量的所有进展上进行平均。该方法使用一个短的约数和近似的冯Mangoldt函数，连同一些新的结果，这种约数和近似的二进制相关的等差数列。
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.
A note on Farey fractions with denominators in arithmetic progressions
作为在前两篇论文中进行的一系列调查的结论，我们计算了连续Farey分数的差的分子所取的值的渐近频率，其中的差限制在等差数列中。
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.
Second numbers in arithmetic progressions
我们提出了一个长度为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.
Square-free numbers in arithmetic progressions
我们给出了与固定模上的等差数列中无平方数分布相关和的渐进性。作为特例，改进了Blomer关于方差的一个结果.
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 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表示的平均数问题，获得了渐近结果，并证明了该结果本质上是最佳的。
On Character Sums and Exponential Sums over Generalized Arithmetic Progressions
研究了Dirichlet特征标和的上界.证明了广义真等差数列上特征和的一致上界，推广了经典的Polya不等式和Vinogradov不等式.我们的论点是基于得到一个上界的广义等差数列的傅里叶系数的l1范数。我们的方法也适用于多项式指数和的上界。
Fix coprime natural numbers $a,q$. Assuming the Prime $k$-tuple Conjecture, we show that there exist arbitrarily long arithmetic progressions of Carmichael numbers, each of which lies in the reduced residue class $a$ mod $q$ and is a product of three distinct prime numbers.
On the length of an arithmetic progression of the form ${3^x+2^y}$
研究数论中形如 ${3^x+2^y}$ 的等差数列长度问题，并证明其长度至多为六。
We prove explicit versions of Cramér's theorem for primes in arithmetic progressions, on the assumption of the generalized Riemann hypothesis.
The divisor function in arithmetic progressions to smooth moduli
本文利用vanderCorput方法的$q$ -模拟方法，研究了模为$q$的等差数列中的除数函数.我们表明，预期的渐近公式适用于更大范围的$q$比以前已知的，只要$q$有一定的因式分解。
Integers without divisors from a fixed arithmetic progression
设a为整数，q为素数.本文给出了等差数列a模q中正整数个数n1的一个渐近公式< x with the property that no divisor d >。
Arithmetic progressions consisting of unlike powers
本文给出了等差数列不等幂的一些新结果。除其他事项外，我们证明，对于给定的$k\geq 4$和$L\geq 3$有只有1000多等差数列的形式$(x_0^{l_0},x_1^{l_1},...,x_{k-1}^{l_{k-1}})$与$x_i\in{\Bbb Z},$ gcd $(x_0,x_1)=1$和$2\leq l_i\leq L$为$i=0,1,...,k-1.$此外，我们表明，对于L=3，级数$(1,1,...,1)$是唯一这样的进展签署。
Iannucci considered the positive divisors of a natural number $n$ that do not exceed $\sqrt{n}$ and found all forms of numbers whose such divisors are in arithmetic progression. In this paper, we generalize Iannucci's result by excluding the trivial divisors $1$ and $\sqrt{n}$ (when $n$ is a square). Surprisingly, the length of our arithmetic progression cannot exceed $5$.
In this paper, we study how close the terms of a finite arithmetic progression can get to a perfect square. The answer depends on the initial term, the common difference and the number of terms in the arithmetic progression.
The bias conjecture for elliptic curves over finite fields and Hurwitz class numbers in arithmetic progressions
本文研究了Frobenius迹位于算术级数的有限域椭圆曲线的二阶矩偏差猜想，证明偏差对正密度级数为正、对正密度级数为负，与经典猜想相反，并给出了相关矩量的显式公式。
Multiplicative decomposition of arithmetic progressions in prime fields
本文证明了存在一个绝对常数$c>0$，使得如果一个等差数列$\cP$模一个素数$p$不含零，且基数小于$cp$，则它不能表示为两个基数大于1的子集的乘积，除非$\cP=-\cP$或$\cP=\{-2r,r,4r\}$对某个剩余数$r$模$p$ .
In this paper we deal with Diophantine equations involving products of consecutive integers, inspired by a question of Erdős and Graham.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。