Pith. sign in

REVIEW

Universality for low degree factors of random polynomials over finite fields

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2201.06156 v2 pith:2GKIDVV2 submitted 2022-01-16 math.PR math.COmath.NT

Universality for low degree factors of random polynomials over finite fields

classification math.PR math.COmath.NT
keywords randomdegreefactorspolynomialfieldsfiniteirreduciblepolynomials
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We show that the counts of low degree irreducible factors of a random polynomial $f$ over $\mathbb{F}_q$ 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 $q=p$ a prime with $p\leq \exp({n^{1/13}})$ where $n$ is the degree of the polynomial. Our proofs use Fourier analysis, and rely on tools recently applied by Breuillard and Varj\'u to study the $ax+b$ process, which show equidistribution for $f(\alpha)$ at a single point. We extend this to handle multiple roots and the Hasse derivatives of $f$, which allow us to study the irreducible factors with multiplicity.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.