arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.0625math.NT
收藏

短区间和等差数列中的素多项式

Prime polynomials in short intervals and in arithmetic progressions

Efrat Bank, Lior Bary-Soroker, Lior Rosenzweig

摘要:

本文建立了素数上两个经典代数的函数域形式。第一个定理说,在区间(x,x+x^n]中素数的个数约为x^n/log x,第二个定理说,当d^(1+delta)<x时,与a模d全等的素数p<x的个数约为pi(x)/phi(d)。更准确地说,我们证明:设1 \leq m<k是整数,q是素数幂,f是系数在q元有限域中的k次首一多项式.则存在常数c(k),使得具有deg h \leq m的素多项式g=f+h的数目N满足|N-q^(m+1)/k| \leq c(k)q^(m+1/2)。这里,如果\gcd(q,k(k-1))>1,则我们假设m \geq 2,如果q是偶数,则m \geq 3,并且deg f' \leq 1。我们表明,这种估计失败的情况下被忽略。设π_q(k)是q元有限域\FF_q中系数为k次的一元素多项式的个数.对于互素多项式f,D \in \FF_q [t],我们证明了与f模D全等的k次一元素多项式g的个数N'满足|N'-π_q(k)/π_q(D)|\leq c(k)π_q(k)q^{-1/2}/f(D),只要1 \leq °D \leq k-3(或\leq k-4,如果p=2且(f/D)'为常数)。我们也将这些结果推广到其他分解类型。

英文摘要:

In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes p<x that are congruent to a modulo d, for d^(1+delta)<x, is about pi(x)/phi(d). More precisely, we prove: Let 1\leq m<k be integers, let q be a prime power, and let f be a monic polynomial of degree k with coefficients in the finite field with q elements. Then there is a constant c(k) such that the number N of prime polynomials g=f+h with deg h \leq m satisfies |N-q^(m+1)/k|\leq c(k)q^(m+1/2). Here we assume m\geq 2 if \gcd(q,k(k-1))>1 and m\geq 3 if q is even and deg f' \leq 1. We show that this estimation fails in the neglected cases. Let π_q(k) be the number of monic prime polynomials of degree k with coefficients in the finite field with q elements \FF_q. For relatively prime polynomials f,D\in \FF_q[t] we prove that the number N' of monic prime polynomials g that are congruent to f modulo D and of degree k satisfies |N'-π_q(k)/ϕ(D)|\leq c(k)π_q(k)q^{-1/2}/ϕ(D), as long as 1\leq °D\leq k-3 (or \leq k-4 if p=2 and (f/D)' is constant). We also generalize these results to other factorization types.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑