Related papers: Stable Polynomials over Finite Fields

A polynomial $f(x)$ over a field $K$ is called stable if all of its iterates are irreducible over $K$. In this paper we study the stability of trinomials over finite fields. Specially, we show that if $f(x)$ is a trinomial of even degree…

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…

A polynomial $f(x)$ over a field $K$ is said to be stable if all its iterates are irreducible over $K$. L. Danielson and B. Fein have shown that over a large class of fields $K$, if $f(x)$ is an irreducible monic binomial, then it is stable…

One of the interesting problems in arithmetic dynamics is to study the stability of polynomials over a field. In this paper, we study the stability of $f(z)=z^d+\frac{1}{c}$ for $d\geq 2$, $c\in{\mathbb{Z}\setminus\{0\}}$. We show that for…

We prove a new formula for the generating function of polynomials counting absolutely stable representations of quivers over finite fields. The case of irreducible representations is studied in more detail.

Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…

In this note, first we show that there is no stable quadratic polynomial over finite fields of characteristic two and then show that there exist stable quadratic polynomials over function fields of characteristic two.

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…

We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.

We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

The paper presents methods of eigenvalue localisation of regular matrix polynomials, in particular, stability of matrix polynomials is investigated. For this aim a stronger notion of hyperstability is introduced and widely discussed. Matrix…

In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…

We study the number of irreducible factors (over $\mathbb{Q}$) of the $n$th iterate of a polynomial of the form $f_r(x) = x^2 + r$ for rational $r$. When the number of such factors is bounded independent of $n$, we call $f_r(x)$…

A finitely generated quadratic module or preordering in the real polynomial ring is called stable, if it admits a certain degree bound on the sums of squares in the representation of polynomials. Stability, first defined explicitly by…

We determine necessary and sufficient conditions for unicritical polynomials to be dynamically irreducible over finite fields. This result extends the results of Boston-Jones and Hamblen-Jones-Madhu regarding the dynamical irreducibility of…

We introduce and study the notion of conic stability of multivariate complex polynomials in $\mathbb{C}[z_1,\ldots, z_n]$, which naturally generalizes the stability of multivariate polynomials. In particular, we generalize Borcea's and…

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003)…