Factorization statistics of restricted polynomial specializations over large finite fields
نویسندگان
چکیده
For a polynomial F(t, A1, …, An) ∈ $$\mathbb{F}$$ p[t, An] (p being prime number) we study the factorization statistics of its specializations $$F\left({t,{a_1}, \ldots ,{a_n}} \right) \in {\mathbb{F}_p}\left[t \right]$$ with (a1, an) S, where $$S \subset \mathbb{F}_p^n$$ is subset, in limit p → ∞ and deg F fixed. We show that for sufficiently large regular subset , e.g., product n intervals length H1, Hn $$\prod\nolimits_{i = 1}^n {{H_n} > {p^{n - 1/2 +\epsilon}}} $$ same as unrestricted (i.e., ) up to small error. This generalization well-known Pólya-Vinogradov estimate number quadratic residues modulo an interval.
منابع مشابه
Univariate Polynomial Factorization Over Finite Fields
This paper shows that a recently proposed approach of D. Q. Wan to bivariate factorization over finite fields, the univariate factoring algorithm of V. Shoup, and the new bound of this paper for the average number of irreducible divisors of polynomials of a given degree over a finite field can be used to design a bivariate factoring algorithm that is polynomial for "almost all" bivariate polyno...
متن کاملArithmetic Properties of Polynomial Specializations over Finite Fields
We present applications of some recent results that establish a partial finite field analogue of Schinzel’s Hypothesis H. For example, we prove that the distribution of gaps between degree n prime polynomials over Fp is close to Poisson for p large compared to n. We also estimate the number of polynomial substitutions without prime factors of large degree (“smooth” polynomial substitutions); th...
متن کاملPolynomial-Time Factorization of Multivariate Polynomials over Finite Fields
We present a probabilistic algorithm that finds the irreducible factors of a bivariate polynomial with coefficients from a finite field in time polynomial in the input size, i.e. in the degree of the polynomial and log (cardinality of field). The algorithm generalizes to multivariate polynomials and has polynomial running time for densely encoded inputs. Also a deterministic version of the algo...
متن کاملPolynomial factorization algorithms over number fields
Factorization algorithms over Q[X] and Fp[X] are key tools of computational number theory. Many algorithms over number fields rely on the possibility of factoring polynomials in those fields. Because of the recent development of relative methods in computational number theory, see for example (Cohen et al. 1998, Daberkow and Pohst 1995), efficient generalizations of factorization algorithms to ...
متن کاملSimultaneous Prime Specializations of Polynomials over Finite Fields
Recently the author proposed a uniform analogue of the Bateman-Horn conjectures for polynomials with coefficients from a finite field (i.e., for polynomials in Fq [T ] rather than Z[T ]). Here we use an explicit form of the Chebotarev density theorem over function fields to prove this conjecture in particular ranges of the parameters. We give some applications including the solution of a proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2021
ISSN: ['1565-8511', '0021-2172']
DOI: https://doi.org/10.1007/s11856-021-2101-9