Decidability of rational solvability for multivariate polynomial equations
Determine the decidability of the problem that, given a multivariate polynomial equation with coefficients in the rational numbers, decides whether the equation has a solution in the rational numbers. Establish whether a general algorithm exists to decide rational solvability for arbitrary multivariate polynomial equations over Q.
References
Unlike solutions in C (by Hilbert's Nullstellensatz , see e.g., Chap. 4, \S 1) or R (via Tarski-Seidenbergâs theorem , see e.g., ), determining whether a multivariate polynomial equation has a rational solution is a major open problem in number theory .
In the case of a smooth plane cubic curve $\mathfrak{C}$, problem (P1) is still open, that is, we do not have a general technique to establish whether DiophCubic admits a rational point or not.
DiophCubic: