English

Factorization Statistics of Restricted Polynomial Specializations over Large Finite Fields

Number Theory 2018-12-27 v2

Abstract

For a polynomial F(t,A1,,An)Fp[t,A1,,An]F(t,A_1,\ldots,A_n)\in\mathbf{F}_p[t,A_1,\ldots,A_n] (pp being a prime number) we study the factorization statistics of its specializations F(t,a1,,an)Fp[t]F(t,a_1,\ldots,a_n)\in\mathbf{F}_p[t] with (a1,,an)S(a_1,\ldots,a_n)\in S, where SFpnS\subset\mathbf{F}_p^n is a subset, in the limit pp\to\infty and degF\mathrm{deg} F fixed. We show that for a sufficiently large and regular subset SFpnS\subset\mathbf{F}_p^n, e.g. a product of nn intervals of length H1,,HnH_1,\ldots,H_n with i=1nHn>pn1/2+ϵ\prod_{i=1}^nH_n>p^{n-1/2+\epsilon}, the factorization statistics is the same as for unrestricted specializations (i.e. S=FpnS=\mathbf{F}_p^n) up to a small error. This is a generalization of the well-known P\'olya-Vinogradov estimate of the number of quadratic residues modulo pp in an interval.

Keywords

Cite

@article{arxiv.1810.07512,
  title  = {Factorization Statistics of Restricted Polynomial Specializations over Large Finite Fields},
  author = {Alexei Entin},
  journal= {arXiv preprint arXiv:1810.07512},
  year   = {2018}
}
R2 v1 2026-06-23T04:43:05.132Z