A perfect polynomial over is a polynomial that equals the sum of all its divisors. If then we say that 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
In this paper, we study the properties of the sequence of polynomials given by , for , where is non-constant and the characteristic of is . 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.
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, . 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 , where is a finite field of q elements....
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 -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...
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.
In this paper we consider the extremal even self-dual -additive codes. We give a complete classification for length . Under the hypothesis that at least two minimal words have the same support, we classify the codes of length and we show that in length such a code is equivalent to the unique -hermitian code with parameters [18,9,8]. We construct with the help of them some extremal -modular lattices.
We estimate the number of possible degree patterns of k-lacunary polynomials of degree t < p which split completely modulo p. The result is based on a combination of a bound on the number of zeros of lacunary polynomials with some graph theory arguments.