Hostname: page-component-6766d58669-vgfm9 Total loading time: 0 Render date: 2026-05-17T21:48:59.149Z Has data issue: false hasContentIssue false

How to solve a binary cubic equation in integers

Published online by Cambridge University Press:  07 March 2024

DAVID MASSER*
Affiliation:
Departement Mathematik und Informatik, Universität Basel, Spiegelgasse 1, 4051 Basel, Switzerland e-mail:David.Masser@unibas.ch
Rights & Permissions [Opens in a new window]

Abstract

Given 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.

MSC classification

Information

Type
Research Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of Cambridge Philosophical Society