Cubic forms without monomials in two variables

It is proved that a general cubic form over the field of complex numbers can be transformed into a form without monomials of exactly two variables by means of a non-degenerate linear transformation of coordinates. If the coefficients of monomials in only one variable are equal to one, and the remaining coefficients belong to sufficiently small polydisc near zero, then the transformation can be approximated by iterative algorithm. Under these restrictions the same result holds over the reals. This result generalizes the Levy–Desplanques theorem on strictly diagonally dominant matrices. We discuss in detail the properties of reducible cubic forms. So we prove the existence of a reducible real cubic form that is not equivalent to any form with all monomials in only one variable and without any monomials in exactly two variables. We suggest a sufficient condition for the existence of a singular point on a projective cubic hypersurface. The computational complexity of singular points recognition is discussed.