Irreducible polynomials with several prescribed coefficients
Junsoo Ha

TL;DR
This paper proves that for large finite fields, there exist irreducible polynomials with a significant number of prescribed coefficients, extending previous bounds and using Bourgain's technique.
Contribution
It improves existing bounds on the number of prescribed coefficients in irreducible polynomials over finite fields, applying Bourgain's method for broader cases.
Findings
Existence of irreducible polynomials with up to approximately quarter of the coefficients prescribed for large q.
Extension of bounds from rom rom previous rom Pollack's rom work.
Applicable for any finite field size q with improved coefficient constraints.
Abstract
We study the number of irreducible polynomials over with some coefficients prescribed. Using the technique developed by Bourgain, we show that there is an irreducible polynomial of degree with coefficients prescribed in any location when for any and is large; and when for some and for any . The result is improved from the earlier work of Pollack that the similar result holds for .
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
TopicsAnalytic Number Theory Research · Coding theory and cryptography · Limits and Structures in Graph Theory
