Search

In this paper, we extend the definition of the Nathanson height from points in projective spaces over to points in projective spaces over arbitrary finite fields. If , then the Nathanson height is where with the field norm and the element of congruent to modulo p. We investigate the basic properties of this extended height, provide some bounds, study its image on the projective line and propose some questions for further research. [ABSTRACT FROM AUTHOR]

Given an irreducible polynomial f in k[X1,..., Xn] (where k is a field) such that k is algebraically closed in the quotient field of A ≔ k[X1,...,Xn]/f k[X1,...,Xn], we show that k(f) is algebraically closed in k(X1,...,Xn). Further, if n ≥ 2 and char k = 0, then we show that the number of k-translates of f that are reducible in k[X1,..., Xn] is bounded above by the rank of U(A)/U(k). Finally, we prove a similar bound for the number of reducible composites of the form Γ(f) with Γ ∈ k[T] monic irreducible. [ABSTRACT FROM AUTHOR]

Abstract: The problem to express an matrix A as the sum of two square-zero matrices was first investigated by Wang and Wu for matrices over the complex field. This paper investigates the problem over an arbitrary field F. It is shown that, if char, then is the sum of two square-zero matrices if and only if A is similar to a matrix of the form , where N is nilpotent, X is nonsingular, and each is a companion matrix associated with an even-power poly nomial with nonzero constant term. If F is of characteristic two, the term falls away. If F is of characteristic zero and algebraically closed, the term falls away and the result of Wang and Wu is obtained. [Copyright &y& Elsevier]

Abstract: A practical computational system is described for computing with an algebraic closure of a field. The system avoids factorization of polynomials over extension fields, but gives the illusion of a genuine field to the user. All roots of an arbitrary polynomial defined over such an algebraically closed field can be constructed and are easily distinguished within the system. The difficult case of inseparable extensions of function fields of positive characteristic is also handled properly by the system. A technique of modular evaluation into a finite field critically ensures that a unique genuine field is simulated by the system but also provides fast optimizations for some fundamental operations. Fast matrix techniques are also used for several non-trivial operations. The system has been successfully implemented within the Magma Computer Algebra System, and several examples are presented, using this implementation. [Copyright &y& Elsevier]