Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Universality for low degree factors of random polynomials over finite fields (2201.06156v2)

Published 16 Jan 2022 in math.PR, math.CO, and math.NT

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.

Summary

We haven't generated a summary for this paper yet.