On the Diophantine equation 𝐺_{𝑛}(𝑥)=𝐺_{𝑚}(𝑃(𝑥)): Higher-order recurrences

DOI10.1090/S0002-9947-03-03325-7zbMath1026.11040MaRDI QIDQ4419590

Clemens Fuchs, Robert F. Tichy, Attila Pethoe

Publication date: 13 August 2003

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

linear Diophantine equations; \(S\)-unit equations; linear recurrence sequences

Mathematics Subject Classification ID

11B37: Recurrences

11D45: Counting solutions of Diophantine equations

11D04: Linear Diophantine equations

Related Items

Effective bounds for the zeros of linear recurrences in function fields, On the integer solutions of exponential equations in function fields., Composite values of polynomial power sums, Decomposable polynomials in second order linear recurrence sequences, Composite rational functions having a bounded number of zeros and poles, On the Diophantine Equation G n (x) = G m (y) with Q (x, y)=0

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic function fields and codes
• The multiplicity of binary recurrences
• On the Diophantine equation \(G_n(x)=G_m(P(x))\) for third order linear recurring sequences
• The zero multiplicity of linear recurrence sequences
• On the Diophantine equation \(G_{n}(x) = G_{m}(P(x))\)
• Linear equations in variables which lie in a multiplicative group
• A note on recurring series
• The equation x+y=1 in finitely generated groups
• Vanishing sums in function fields
• On equations in two S-units over function fields of characteristic 0