Creating Decidable Diophantine Equations

Generalizing an argument of Matiyasevich, we illustrate a method to generateinfinitely many diophantine equations whose solutions can be completelydescribed by linear recurrences. In particular, we provide aninteger-coefficient polynomial p(x, y, z) whose only integer roots areconsecutive triples of Tribonacci numbers.