Papers
Topics
Authors
Recent
Search
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.

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.

Collections

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