Page 1 Next

Displaying 1 – 20 of 39

Showing per page

On Alternatives of Polynomial Congruences

Mariusz Skałba (2004)

Bulletin of the Polish Academy of Sciences. Mathematics

What should be assumed about the integral polynomials f ( x ) , . . . , f k ( x ) in order that the solvability of the congruence f ( x ) f ( x ) f k ( x ) 0 ( m o d p ) for sufficiently large primes p implies the solvability of the equation f ( x ) f ( x ) f k ( x ) = 0 in integers x? We provide some explicit characterizations for the cases when f j ( x ) are binomials or have cyclic splitting fields.

On an iterated construction of irreducible polynomials over finite fields of even characteristic by Kyuregyan

Simone Ugolini (2016)

Czechoslovak Mathematical Journal

We deal with the construction of sequences of irreducible polynomials with coefficients in finite fields of even characteristic. We rely upon a transformation used by Kyuregyan in 2002, which generalizes the Q -transform employed previously by Varshamov and Garakov (1969) as well as by Meyn (1990) for the synthesis of irreducible polynomials. While in the iterative procedure described by Kyuregyan the coefficients of the initial polynomial of the sequence have to satisfy certain hypotheses, in the...

On some issues concerning polynomial cycles

Tadeusz Pezda (2013)

Communications in Mathematics

We consider two issues concerning polynomial cycles. Namely, for a discrete valuation domain R of positive characteristic (for N 1 ) or for any Dedekind domain R of positive characteristic (but only for N 2 ), we give a closed formula for a set 𝒞 Y C L ( R , N ) of all possible cycle-lengths for polynomial mappings in R N . Then we give a new property of sets 𝒞 Y C L ( R , 1 ) , which refutes a kind of conjecture posed by W. Narkiewicz.

Currently displaying 1 – 20 of 39

Page 1 Next