Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/ou_press/irreducible-compositions-of-degree-two-polynomials-over-finite-fields-0W094hv73q
References (22)
-
Vitaly Skachek, R. Roth (2008)
Probabilistic algorithm for finding roots of linearized polynomialsDesigns, Codes and Cryptography, 46
-
Domingo Gómez-Pérez, A. Piñera-Nicolás (2010)
An estimate on the number of stable quadratic polynomialsFinite Fields Their Appl., 16
-
J. Hopcroft, J. Ullman (1979)
Introduction to Automata Theory, Languages and Computation -
O. Ahmadi, F. Luca, Alina Ostafe, I. Shparlinski (2012)
ON STABLE QUADRATIC POLYNOMIALSGlasgow Mathematical Journal, 54
-
Rafe Jones (2007)
Iterated Galois towers, their associated martingales, and the $p$-adic Mandelbrot setCompositio Mathematica, 143
-
(2012)
An iterative construction of irreducible polynomials reducible modulo every primeJ. Algebra, 369
-
A. Ferraguti, Giacomo Micheli (2016)
On the existence of infinite, non-trivial F-setsJournal of Number Theory, 168
-
Alina Ostafe, I. Shparlinski (2009)
On the length of critical orbits of stable quadratic polynomials, 138
-
Rafe Jones (2006)
The density of prime divisors in the arithmetic dynamics of quadratic polynomialsJournal of the London Mathematical Society, 78
-
David Harvey, J. Hoeven, Grégoire Lecerf (2014)
Faster Polynomial Multiplication over Finite FieldsJournal of the ACM (JACM), 63
-
(1980)
Probabilistic algorithms in finite fieldsSIAM J. Comput., 9
-
(1986)
citation_publisher=Cambridge University Press, Cambridge; Local fields, volume 3 of London Mathematical Society Student Texts -
(2016)
citation_publisher=Springer, Cham; Arithmetic of finite fields, volume 10064 of Lecture Notes in Computer Science -
Rafe Jones (2010)
An iterative construction of irreducible polynomials reducible modulo every primearXiv: Number Theory
-
(2001)
citation_publisher=Addison Wesley, Boston, MA; Introduction to Automata Theory, Languages, and Computation -
D. Heath-Brown, Giacomo Micheli (2017)
Irreducible polynomials over finite fields produced by composition of quadraticsRevista Matemática Iberoamericana
-
Rafe Jones, N. Boston (2012)
Settled polynomials over finite fields, 140
-
J. Andrade, Steven Miller, Kyle Pratt, M. Trinh (2013)
Special Sets of Primes in Function FieldsIntegers, 14
-
O. Ahmadi (2009)
A Note on Stable Quadratic Polynomials over Fields of Characteristic TwoarXiv: Number Theory
-
A. Ferraguti, Giacomo Micheli, R. Schnyder (2016)
On Sets of Irreducible Polynomials Closed by Composition -
J. Gathen (1990)
Functional Decomposition of Polynomials: The Tame CaseJ. Symb. Comput., 9
-
T. Browning, F. Bouyer (2008)
Local Fields
- Publisher
- Oxford University Press
- Copyright
- © The Author(s) 2018. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: [email protected]
- ISSN
- 0033-5606
- eISSN
- 1464-3847
- DOI
- 10.1093/qmath/hay015
- Publisher site
- See Article on Publisher Site
Abstract
Let q be an odd prime power and D be the set of irreducible polynomials in Fq[x] which can be written as a composition of degree two polynomials. In this paper, we prove that D has a natural regular structure by showing that there exists a finite automaton having D as accepted language. Our method is constructive.
Journal
The Quarterly Journal of Mathematics – Oxford University Press
Published: Sep 1, 2018