On the Bateman-Horn conjecture for polynomials over large finite fields

被引:8
|
作者
Entin, Alexei [1 ]
机构
[1] Stanford Univ, Dept Math, 450 Serra Mall, Stanford, CA 94305 USA
基金
欧洲研究理事会;
关键词
function fields; irreducible polynomials; Bateman-Horn; VALUES;
D O I
10.1112/S0010437X16007570
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable x) polynomials F-1,..., F-m is an element of F-q[t][x], we show that the number off integral is an element of q[t] of degree n >= max(3, deg(t) F-1, ..., deg(t) F-m) such that all F-i(t, integral) is an element of F-q[t], 1 <= i <= m, in, are irreducible is (Pi(m)(i=1) mu(i)/N-i)q(n+1)(1 + O-m, (max deg) F-i,F- n(q(-1/2))), where N-i = n deg(x) F-i is the generic degree of F-i(t, f) for deg f = n and mu(i), is the number of factors into which F-i splits over (F) over bar (q). Our proof relies on the classification of finite simple groups. We will also prove the same result for non -associate, irreducible and separable (over F-q(t)) polynomials F-1, ... , F-m not necessarily monic in x under the assumptions that n is greater than the number of geometric points of multiplicity greater than two on the (possibly reducible) affine plane curve C defined by the equation Pi(m)(i=1) F-i(t, x) = 0 (this number is always bounded above by (Sigma(m)(i=1) deg Fi)(2)/2, where deg denotes the total degree in t, x) and P = char F-q > max(1 <= i <= m) N-i, where N-i is the generic degree of F-i(t, f) for deg f = n.
引用
收藏
页码:2525 / 2544
页数:20
相关论文
共 50 条
  • [1] On a Conjecture on Irreducible Polynomials over Finite Fields with Restricted Coefficients
    Ferraguti, Andrea
    Micheli, Giacomo
    ARITHMETIC OF FINITE FIELDS, WAIFI 2022, 2023, 13638 : 3 - 13
  • [2] A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields
    Panario, Daniel
    Tzanakis, Georgios
    FINITE FIELDS AND THEIR APPLICATIONS, 2012, 18 (02) : 303 - 315
  • [3] ON COUNTING POLYNOMIALS OVER FINITE FIELDS
    Chuang, Chih-Yun
    Kuan, Yen-Liang
    Yu, Jing
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2015, 143 (10) : 4305 - 4316
  • [4] On coefficients of polynomials over finite fields
    Muratovic-Ribic, Amela
    Wang, Qiang
    FINITE FIELDS AND THEIR APPLICATIONS, 2011, 17 (06) : 575 - 599
  • [5] Construction of irreducible polynomials over finite fields
    Sharma, P. L.
    Ashima
    ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2022, 15 (07)
  • [6] Construction of primitive polynomials over finite fields
    Alizadeh, Mahmood
    JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2021, 20 (05)
  • [7] On the reducibility of some composite polynomials over finite fields
    Cao, Xiwang
    Hu, Lei
    DESIGNS CODES AND CRYPTOGRAPHY, 2012, 64 (03) : 229 - 239
  • [8] Explicit factorizations of cyclotomic polynomials over finite fields
    Wu, Hongfeng
    Zhu, Li
    Feng, Rongquan
    Yang, Siman
    DESIGNS CODES AND CRYPTOGRAPHY, 2017, 83 (01) : 197 - 217
  • [9] A group action on multivariate polynomials over finite fields
    Reis, Lucas
    FINITE FIELDS AND THEIR APPLICATIONS, 2018, 51 : 218 - 237
  • [10] Explicit factorizations of cyclotomic polynomials over finite fields
    Hongfeng Wu
    Li Zhu
    Rongquan Feng
    Siman Yang
    Designs, Codes and Cryptography, 2017, 83 : 197 - 217