Stable polynomials over finite fields

12Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We use the theory of resultants to study the stability, that is, the property of having all iterates irreducible, of an arbitrary polynomial f over a finite field Fq. This result partially generalizes the quadratic polynomial case described by R. Jones and N. Boston. Moreover, for p = 3, we show that certain polynomials of degree three are not stable. We also use the Weil bound for multiplicative character sums to estimate the number of stable polynomials over a finite field of odd characteristic. © European Mathematical Society.

References Powered by Scopus

Prime and composite polynomials

200Citations
N/AReaders
Get full text

Factorization of polynomials over finite fields

153Citations
N/AReaders
Get full text

The density of prime divisors in the arithmetic dynamics of quadratic polynomials

71Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Eventually stable rational functions

20Citations
N/AReaders
Get full text

On some extensions of the Ailon–Rudnick theorem

13Citations
N/AReaders
Get full text

A note on the stability of trinomials over finite fields

9Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Gómez-Pérez, D., Nicolás, A. P., Ostafe, A., & Sadornil, D. (2014). Stable polynomials over finite fields. Revista Matematica Iberoamericana, 30(2), 523–535. https://doi.org/10.4171/rmi/791

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 2

67%

Researcher 1

33%

Readers' Discipline

Tooltip

Computer Science 2

67%

Mathematics 1

33%

Save time finding and organizing research with Mendeley

Sign up for free