ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Question 18 (Rojas). Is there a computable bound (in function of f ) on the size of the largest integer solution to f (x, y ) = 0, when there are finitely many solutions? This is already done for genus 1 curves. There exists an algorithm to decide finiteness of the set of solutions. For rational points, there are papers by Minhyong Kim from Arizona: "Relating decision and search algorithms for rational points on curves of higher genus", Arch. Math. Logic 42 (2003), no. 6, 563-568 PROBLEMS RELATED TO "EXTENSIONS OF HILBERT'S TENTH PROBLEM" 5

"On relative computability for curves", ArXiv:math.NT/0502224

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.