Papers
Topics
Authors
Recent
Search
2000 character limit reached

Irreducible polynomials with several prescribed coefficients

Published 26 Jan 2016 in math.NT | (1601.06867v1)

Abstract: We study the number of irreducible polynomials over $\mathbf{F}_{q}$ with some coefficients prescribed. Using the technique developed by Bourgain, we show that there is an irreducible polynomial of degree $n$ with $r$ coefficients prescribed in any location when $r \leq \left[\left(1/4 - \epsilon\right)n \right]$ for any $\epsilon>0$ and $q$ is large; and when $r\leq\delta n$ for some $\delta>0$ and for any $q$. The result is improved from the earlier work of Pollack that the similar result holds for $r\leq\left[(1-\epsilon)\sqrt{n}\right]$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.