Abstract
We show that the counts of low degree irreducible factors of a random polynomial over with independent but non-uniform coefficients behave like that of a uniform random polynomial, exhibiting a form of universality for random polynomials over finite fields. Our strongest results require various assumptions on the parameters, but we are able to obtain results requiring only a prime with where is the degree of the polynomial. Our proofs use Fourier analysis, and rely on tools recently applied by Breuillard and Varjú to study the process, which show equidistribution for at a single point. We extend this to handle multiple roots and the Hasse derivatives of , which allow us to study the irreducible factors with multiplicity.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.