On the Diophantine Equation G n (x) = G m (y) with Q (x, y)=0

DOI10.1007/978-3-211-74280-8_10zbMath1215.11031MaRDI QIDQ3530433

Robert F. Tichy, Clemens Fuchs, Attila Pethoe

Publication date: 20 October 2008

Published in: Diophantine Approximation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-211-74280-8_10

zbMATH Keywords

linear recurring sequences; diophantine equations; S-unit equations

Mathematics Subject Classification ID

11B37: Recurrences

11D45: Counting solutions of Diophantine equations

11D61: Exponential Diophantine equations

11D04: Linear Diophantine equations

Related Items

Effective bounds for the zeros of linear recurrences in function fields, Composite values of polynomial power sums, Decomposable polynomials in second order linear recurrence sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic function fields and codes
• Effective bounds for the zeros of linear recurrences in function fields
• Finiteness of integral values for the ratio of two linear 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 integer solutions of exponential equations in function fields.
• On the Diophantine equation \(G_{n}(x) = G_{m}(P(x))\)
• Linear equations in variables which lie in a multiplicative group
• On the Diophantine equation 𝐺_{𝑛}(𝑥)=𝐺_{𝑚}(𝑃(𝑥)): Higher-order recurrences
• The Diophantine equation f(x) = g(y)