On the Diophantine equation G_n(x) = G_m(P(x))

DOI10.1007/S00605-002-0497-9MaRDI QIDQ1865178zbMATH OpenOpenAlexFDO

Authors Clemens Fuchs, Attila Pethő, Robert F. Tichy

Publication date 25 March 2003

Published in Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00605-002-0497-9

zbMATH Keywords

\(S\)-unit equationslinear Diophantine equationslinear recurring sequencesorthogonal polynomialssecond-order linear recurring sequence

Mathematics Subject Classification ID

Recurrences (11B37) Linear Diophantine equations (11D04) Counting solutions of Diophantine equations (11D45)

Recommendations

• On the Diophantine equation \(G_n(x)=G_m(P(x))\) for third order linear recurring sequences
• On the Diophantine equation 𝐺_{𝑛}(𝑥)=𝐺_{𝑚}(𝑃(𝑥)): Higher-order recurrences
• Diophantine equations for Morgan-Voyce and other modified orthogonal polynomials
• On the Diophantine Equation G n (x) = G m (y) with Q (x, y)=0
• Diophantine equations between polynomials obeying second order recurrences

Cited in

(11)

• On the Diophantine equation \(G_n(x)=G_m(P(x))\) for third order linear recurring sequences
• Diophantine equations for classical continuous orthogonal polynomials
• On decompositions of binary recurrent polynomials
• Composite values of polynomial power sums
• Decomposable polynomials in second order linear recurrence sequences
• Diophantine equations between polynomials obeying second order recurrences
• scientific article; zbMATH DE number 2186400 (Why is no real title available?)
• On the Diophantine Equation G n (x) = G m (y) with Q (x, y)=0
• On the Diophantine equation 𝐺_{𝑛}(𝑥)=𝐺_{𝑚}(𝑃(𝑥)): Higher-order recurrences
• Perfect powers in polynomial power sums
• Effective bounds for the zeros of linear recurrences in function fields

This page was built for publication: On the Diophantine equation \(G_{n}(x) = G_{m}(P(x))\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865178)