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

$\mathbb{Z}[X]$ 上随机多项式的不可约性

Irreducibility of random polynomials of $\mathbb{Z}[X]$

Pierre-Alexandre Bazin

AI总结:

本文改进了整数环上随机多项式不可约概率的收敛速度,在模十二个素数满足近似一致性的条件下证明了最优界 $1-O(1/\sqrt n)$。

摘要:

在近期的一篇论文中,Bary-Soroker、Koukoulopoulos 和 Kozma 证明了:当 $A$ 是 $\mathbb{Z}[X]$ 上次数为确定性次数 $n$ 的随机首一多项式,且其系数 $a_j$ 根据测度 $μ_j$ 独立抽取时,若 $μ_j$ 模四个素数满足近似一致的条件(特别地,当 $μ_j$ 在长度 $N\ge 35$ 的 $\mathbb Z$ 区间上均匀分布时即发生此情况),则当 $n\to\infty$ 时,$A$ 不可约的概率趋于 $1$。本文在模更多素数满足近似一致条件的情况下,改进了收敛速度。值得注意的是,当模十二个素数满足近似一致性时(特别地,当 $μ_j$ 在长度 $N\ge 10^8$ 的区间上均匀分布时即发生此情况),我们得到了最优界 $\mathbb{P}(A \text{ 不可约}) = 1 -O(1/\sqrt n)$。

英文摘要:

In a recent paper, Bary-Soroker, Koukoulopoulos and Kozma proved that when $A$ is a random monic polynomial of $\mathbb{Z}[X]$ of deterministic degree $n$ with coefficients $a_j$ drawn independently according to measures $μ_j,$ then $A$ is irreducible with probability tending to $1$ as $n\to\infty$ under a condition of near-uniformity of the $μ_j$ modulo four primes (which notably happens when the $μ_j$ are uniform over a segment of $\mathbb Z$ of length $N\ge 35.$) We improve here the speed of convergence when we have the near-uniformity condition modulo more primes. Notably, we obtain the optimal bound $\mathbb{P}(A \text{ irreducible}) = 1 -O(1/\sqrt n)$ when we have near-uniformity modulo twelve primes, which notably happens when the $μ_j$ are uniform over a segment of length $N\ge 10^8.$

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

↑