Irreducible polynomials over finite fields produced by composition of quadratics
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 ( q)3 q1/2 ) operations.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.