Universality for Low-Degree Factors of Random Polynomials over Finite Fields

Author:

He Jimmy1,Tuan Pham Huy2,Wenqiang Xu Max2

Affiliation:

1. Department of Mathematics , MIT, Cambridge, MA 02139, USA

2. Department of Mathematics, Stanford University , Stanford, CA 94305, USA

Abstract

Abstract We show that the counts of low-degree irreducible factors of a random polynomial $f$ over $\mathbb {F}_q$ with independent but nonuniform 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ú 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.

Publisher

Oxford University Press (OUP)

Subject

General Mathematics

Reference34 articles.

1. Sharp and simple bounds for the raw moments of the binomial and Poisson distributions;Ahle,2022

2. On random polynomials over finite fields;Arratia;Math. Proc. Cambridge Philos. Soc.,1993

3. Logarithmic combinatorial structures: a probabilistic approach

4. Roots of polynomials and the derangement problem;Bary-Soroker;Amer. Math. Monthly,2018

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3