Irreducibility of Polynomials with Square Coefficients over Finite Fields
Lior Bary-Soroker, Roy Shmueli

TL;DR
This paper investigates the probability that a random polynomial over a finite field, with coefficients chosen uniformly from squares, is irreducible, showing it approaches 1/n as the field size increases.
Contribution
It provides the first asymptotic probability result for irreducibility of polynomials with square coefficients over finite fields.
Findings
Probability of irreducibility approaches 1/n as q increases
Method applies to polynomials with coefficients from other specific sets
Asymptotic behavior characterized for large finite fields
Abstract
We study a random polynomial of degree over the finite field , where the coefficients are independent and identically distributed and uniformly chosen from the squares in . Our main result demonstrates that the likelihood of such a polynomial being irreducible approaches as the field size grows infinitely large. The analysis we employ also applies to polynomials with coefficients selected from other specific sets.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Polynomial and algebraic computation · Algebraic Geometry and Number Theory
