FACTORIZATION STATISTICS OF RESTRICTED POLYNOMIAL SPECIALIZATIONS OVER LARGE FINITE FIELDS

被引:1
|
作者
Entin, Alexei [1 ]
机构
[1] Tel Aviv Univ, Sch Math Sci, IL-69978 Tel Aviv, Israel
关键词
D O I
10.1007/s11856-021-2101-9
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
For a polynomial F(t, A(1),..., A(n)) is an element of F-p[t, A(1),..., A(n)] (p being a prime number) we study the factorization statistics of its specializations F(t, a(1), ..., a(n)) is an element of F-p[t] with (a(1),..., a(n)) is an element of S, where S subset of F-p(n) is a subset, in the limit p -> infinity and deg F fixed. We show that for a sufficiently large and regular subset S subset of F-p(n), e.g., a product of n intervals of length H-1,..., H-n with Pi(n)(i=1) H-n > p(n-1/2+epsilon,) the factorization statistics is the same as for unrestricted specializations (i. e., S = F(p)(n)p) up to a small error. This is a generalization of the well-known Polya-Vinogradov estimate of the number of quadratic residues modulo p in an interval.
引用
收藏
页码:37 / 53
页数:17
相关论文
共 50 条
  • [1] Factorization statistics of restricted polynomial specializations over large finite fields
    Alexei Entin
    [J]. Israel Journal of Mathematics, 2021, 242 : 37 - 53
  • [2] Arithmetic properties of polynomial specializations over finite fields
    Pollack, Paul
    [J]. ACTA ARITHMETICA, 2009, 136 (01) : 57 - 79
  • [3] Univariate polynomial factorization over finite fields with large extension degree
    van der Hoeven, Joris
    Lecerf, Gregoire
    [J]. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2024, 35 (02) : 121 - 149
  • [4] Univariate polynomial factorization over finite fields with large extension degree
    Joris van der Hoeven
    Grégoire Lecerf
    [J]. Applicable Algebra in Engineering, Communication and Computing, 2024, 35 : 121 - 149
  • [5] Univariate polynomial factorization over finite fields
    Naudin, P
    Quitte, C
    [J]. THEORETICAL COMPUTER SCIENCE, 1998, 191 (1-2) : 1 - 36
  • [6] ON POLYNOMIAL FACTORIZATION OVER FINITE-FIELDS
    GUNJI, H
    ARNON, D
    [J]. MATHEMATICS OF COMPUTATION, 1981, 36 (153) : 281 - 287
  • [7] ON BIVARIATE POLYNOMIAL FACTORIZATION OVER FINITE-FIELDS
    SHPARLINSKI, IE
    [J]. MATHEMATICS OF COMPUTATION, 1993, 60 (202) : 787 - 791
  • [8] The complete analysis of a polynomial factorization algorithm over finite fields
    Flajolet, P
    Gourdon, X
    [J]. JOURNAL OF ALGORITHMS, 2001, 40 (01) : 37 - 81
  • [9] TOWARD AN OPTIMAL QUANTUM ALGORITHM FOR POLYNOMIAL FACTORIZATION OVER FINITE FIELDS
    Doliskani, Javad
    [J]. QUANTUM INFORMATION & COMPUTATION, 2019, 19 (1-2) : 1 - 13
  • [10] Polynomial Factorization Over Henselian Fields
    Alberich-Carraminana, Maria
    Guardia, Jordi
    Nart, Enric
    Poteaux, Adrien
    Roe, Joaquim
    Weimann, Martin
    [J]. FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2024,