2000 character limit reached
Irreducible polynomials over finite fields produced by composition of quadratics
Published 18 Jan 2017 in math.NT | (1701.05031v2)
Abstract: For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in $C$ is irreducible. As a second result, we give an algorithm to determine whether all the elements in $C$ are irreducible, using only $O( #S (\log q)3 q{1/2} )$ operations.
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.