arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1012.2857math.NT
收藏

模每个素数可约的不可约多项式的迭代构造

An iterative construction of irreducible polynomials reducible modulo every prime

Rafe Jones

摘要:

给出了一种构造整体域F上任意大次数不可约但模F的每个素数可约的多项式的方法。该方法包括在F[x]中找到其迭代具有所需性质的二次f,并且它依赖于确保f的所有迭代都不可约的新标准。特别是当F是一个数域,其中理想(2)不是一个平方时,我们构造了无穷多个二次f族,使得每个f^n在F上不可约,但f^n模F的所有素数可约,其中n至少为2。我们还给出了一个例子,为每个n的二次f与整数系数的迭代都是不可约的有理数,其(n-1)的第一个是不可约模一些素数,和其第n个可约模所有素数。从伽罗瓦论的角度来看,这表明对于通过多项式迭代获得的伽罗瓦表示,不存在线性伽罗瓦表示的众所周知的刚性现象。最后,我们研究了定义在整体域上的给定二次函数f对于所有n都有f^n模P不可约的素数P的个数。

英文摘要:

We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property, and it depends on new criteria ensuring all iterates of f are irreducible. In particular when F is a number field in which the ideal (2) is not a square, we construct infinitely many families of quadratic f such that every iterate f^n is irreducible over F, but f^n is reducible modulo all primes of F for n at least 2. We also give an example for each n of a quadratic f with integer coefficients whose iterates are all irreducible over the rationals, whose (n-1)st iterate is irreducible modulo some primes, and whose nth iterate is reducible modulo all primes. From the perspective of Galois theory, this suggests that a well-known rigidity phenomenon for linear Galois representations does not exist for Galois representations obtained by polynomial iteration. Finally, we study the number of primes P for which a given quadratic f defined over a global field has f^n irreducible modulo P for all n.

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

↑