Elliptic divisibility sequences and undecidable problems about rational points
Gunther Cornelissen, Karim Zahidi
Abstract
Julia Robinson has given a first-order definition of the rational integers Z in the rational numbers Q by a formula (∀ ∃ ∀ ∃)(F=0) where the ∀-quantifiers run over a total of 8 variables, and where F is a polynomial. This implies that the Σ5-theory of Q is undecidable. We prove that a conjecture about elliptic curves provides an interpretation of Z in Q with quantifier complexity ∀ ∃, involving only one universally quantified variable. This improves the complexity of defining Z in Q in two ways, and implies that the Σ3-theory, and even the Π2-theory, of Q is undecidable (recall that Hilbert's Tenth Problem for Q is the question whether the Σ1-theory of Q is undecidable). In short, granting the conjecture, there is a one-parameter family of hypersurfaces over Q for which one cannot decide whether or not they all have a rational point. The conjecture is related to properties of elliptic divisibility sequences on an elliptic curve and its image under rational 2-descent, namely existence of primitive divisors in suitable residue classes, and we discuss how to prove weaker-in-density versions of the conjecture and present some heuristics.
Create a lesson
Related papers
Value distribution of multiplicative functions along linear fractional sequences
Sun-Kai Leung
Delta theory of Anderson Modules II: Hodge-Pink structure
Sudip Pandit, Arnab Saha
Integers divisible by a shifted prime in a given interval
Rebecca Abi Abdallah, Valeriya Kovaleva, Jeremy Schlitt et al.
On Piatetski-Shapiro primes from almost primes
Yuhua Zhao, Jinjiang Li, Linji Long et al.
On Consecutive Non-primitive Elements over Finite Fields
Bidushi Sharma, Dhiren Kumar Basnet
Birch's theorem over function fields with quadratically many variables
Matthew Hase-Liu