The open quadrant problem: A topological proof

Abstract

In this work we present a new polynomial mapThe proof of this fact involves arguments of topological nature that avoid hard computer calculations. In addition each polynomial f i ∈ R[x, y] has degree ≤ 16 and only 11 monomials, becoming the simplest known map solving the open quadrant problem.