2000 character limit reached
Irreducible polynomials with several prescribed coefficients (1601.06867v1)
Published 26 Jan 2016 in math.NT
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]$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.