The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
1. Introduction. The Waring problem for polynomial cubes over a finite field F of characteristic 2 consists in finding the minimal integer m ≥ 0 such that every sum of cubes in F[t] is a sum of m cubes. It is known that for F distinct from ₂, ₄, , each polynomial in F[t] is a sum of three cubes of polynomials (see [3]).
If a polynomial P ∈ F[t] is a sum of n cubes of polynomials in F[t] such that each cube A³ appearing in the decomposition has degree < deg(P)+3, we say that P is a restricted...
We are concerned with solving polynomial equations over rings. More precisely, given a commutative domain A with 1 and a polynomial equation antn + ...+ a0 = 0 with coefficients ai in A, our problem is to find its roots in A.
We show that when A = B[x] is a polynomial ring, our problem can be reduced to solving a finite sequence of polynomial equations over B. As an application of this reduction, we obtain...
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.
Download Results (CSV)