How to solve a binary cubic equation in integers

Abstract

AbstractGiven any polynomial in two variables of degree at most three with rational integer coefficients, we obtain a new search bound to decide effectively if it has a zero with rational integer coefficients. On the way we encounter a natural problem of estimating singular points. We solve it using elementary invariant theory but an optimal solution would seem to be far from easy even using the full power of the standard Height Machine.