Displaying 221 – 240 of 497

Showing per page

Odd perfect polynomials over 𝔽 2

Luis H. Gallardo, Olivier Rahavandrainy (2007)

Journal de Théorie des Nombres de Bordeaux

A perfect polynomial over 𝔽 2 is a polynomial A 𝔽 2 [ x ] that equals the sum of all its divisors. If gcd ( A , x 2 + x ) = 1 then we say that A is odd. In this paper we show the non-existence of odd perfect polynomials with either three prime divisors or with at most nine prime divisors provided that all exponents are equal to 2 .

On a binary recurrent sequence of polynomials

Reinhardt Euler, Luis H. Gallardo, Florian Luca (2014)

Communications in Mathematics

In this paper, we study the properties of the sequence of polynomials given by g 0 = 0 , g 1 = 1 , g n + 1 = g n + Δ g n - 1 for n 1 , where Δ 𝔽 q [ t ] is non-constant and the characteristic of 𝔽 q is 2 . This complements some results from R. Euler, L.H. Gallardo: On explicit formulae and linear recurrent sequences, Acta Math. Univ. Comenianae, 80 (2011) 213-219.

On a problem of Sidon for polynomials over finite fields

Wentang Kuo, Shuntaro Yamagishi (2016)

Acta Arithmetica

Let ω be a sequence of positive integers. Given a positive integer n, we define rₙ(ω) = |(a,b) ∈ ℕ × ℕ : a,b ∈ ω, a+b = n, 0 < a < b|. S. Sidon conjectured that there exists a sequence ω such that rₙ(ω) > 0 for all n sufficiently large and, for all ϵ > 0, l i m n r ( ω ) / n ϵ = 0 . P. Erdős proved this conjecture by showing the existence of a sequence ω of positive integers such that log n ≪ rₙ(ω) ≪ log n. In this paper, we prove an analogue of this conjecture in q [ T ] , where q is a finite field of q elements....

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 canonical subfield preserving polynomials

Giacomo Micheli, Davide Schipani (2014)

Acta Arithmetica

Explicit monoid structure is provided for the class of canonical subfield preserving polynomials over finite fields. Some classical results and asymptotic estimates will follow as corollaries.

Currently displaying 221 – 240 of 497