### A Condition for a Polynomial Map to be Invertible.

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Given a set of points in the complex plane, an incomplete polynomial is defined as the one which has these points as zeros except one of them. The classical result known as Gauss-Lucas theorem on the location of zeros of polynomials and their derivatives is extended to convex linear combinations of incomplete polynomials. An integral representation of convex linear combinations of incomplete polynomials is also given.

In this note we provide a direct and simple proof of a result previously obtained by Astier stating that the class of spaces of orderings for which the pp conjecture holds true is closed under sheaves over Boolean spaces.

Let K be an ordered field and R its real closure. A semipolynomial will be defined as a function from Rn to R obtained by composition of polynomial functions and the absolute value. Every semipolynomial can be defined as a straight-line program containing only instructions with the following type: polynomial, absolute value, sup and inf and such a program will be called a semipolynomial expression. It will be proved, using the ordinary real positivstellensatz, a general real positivstellensatz concerning...

Classical Lüroth theorem states that every subfield K of K(t), where t is a transcendental element over K, such that K strictly contains K, must be K = K(h(t)), for some non constant element h(t) in K(t). Therefore, K is K-isomorphic to K(t). This result can be proved with elementary algebraic techniques, and therefore it is usually included in basic courses on field theory or algebraic curves. In this paper we study the validity of this result under weaker assumptions: namely, if K is a subfield...

In the paper an elementary and simple proof of the Fundamental Theorem of Algebra is given.