pith. sign in

arxiv: 1711.04668 · v1 · pith:GOZL6PPQnew · submitted 2017-11-10 · 🧮 math.NT

Diophantine triples in linear recurrence sequences of Pisot type

classification 🧮 math.NT
keywords recurrencesequencesdiophantinetripleslinearorderpisotsequence
0
0 comments X
read the original abstract

The study of Diophantine triples taking values in linear recurrence sequences is a variant of a problem going back to Diophantus of Alexandria which has been studied quite a lot in the past. The main questions are, as usual, about existence or finiteness of Diophantine triples in such sequences. Whilst the case of binary recurrence sequences is almost completely solved, not much was known about recurrence sequences of larger order, except for very specialized generalizations of the Fibonacci sequence. Now, we will prove that any linear recurrence sequence with the Pisot property contains only finitely many Diophantine triples, whenever the order is large and a few more not very restrictive conditions are met.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.