arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.04657math.NTmath.CO
收藏

有限域上光滑多项式的一致估计

Uniform estimates for smooth polynomials over finite fields

Ofir Gorodetsky

AI总结:

该研究建立有限域上m-光滑多项式数量的新一致估计,证明其概率渐近于对应m-光滑排列概率且范围紧,解决了Hildebrand猜想的多项式类比,并给出随机多项式最大素因子期望次数的衰减速率。

摘要:

我们建立了有限域$\u211d_q$上次数为$n$的$m$-光滑多项式数量的新估计,其中主项涉及$n$个元素上$m$-光滑排列的数量。我们的估计表明,当$q^n \to \infty$时,次数为$n$的随机多项式是$m$-光滑的概率渐近于$n$个元素上的随机排列是$m$-光滑的概率,且该结果在$m\ge (2+\varepsilon)\log_q n$范围内一致成立。这可被视为整数场景下Hildebrand与Saias研究的无条件类比,后者的工作依赖于黎曼假设。此外,我们证明$m \ge (2+\varepsilon)\log_q n$这一范围是紧的;这可被视为解决了Hildebrand猜想的多项式类比版本。作为估计的一个应用,我们确定了随机多项式最大素因子期望次数的渐近公式中的衰减速率。

英文摘要:

We establish new estimates for the number of $m$-smooth polynomials of degree $n$ over a finite field $\mathbb{F}_q$, where the main term involves the number of $m$-smooth permutations on $n$ elements. Our estimates imply that the probability that a random polynomial of degree $n$ is $m$-smooth is asymptotic to the probability that a random permutation on $n$ elements is $m$-smooth, uniformly for $m\ge (2+\varepsilon)\log_q n$ as $q^n \to \infty$. This should be viewed as an unconditional analogue of works of Hildebrand and of Saias in the integer setting, which assume the Riemann Hypothesis. Moreover, we show that the range $m \ge (2+\varepsilon)\log_q n$ is sharp; this should be viewed as a resolution of a (polynomial analogue of a) conjecture of Hildebrand. As an application of our estimates, we determine the rate of decay in the asymptotic formula for the expected degree of the largest prime factor of a random polynomial.

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

↑