On the Diophantine equation \(G_{n}(x) = G_{m}(P(x))\)
From MaRDI portal
Publication:1865178
DOI10.1007/s00605-002-0497-9zbMath1026.11039OpenAlexW181148075MaRDI QIDQ1865178
Clemens Fuchs, Robert F. Tichy, Attila Pethoe
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
orthogonal polynomialslinear recurring sequenceslinear Diophantine equations\(S\)-unit equationssecond-order linear recurring sequence
Recurrences (11B37) Counting solutions of Diophantine equations (11D45) Linear Diophantine equations (11D04)
Related Items
Effective bounds for the zeros of linear recurrences in function fields ⋮ Perfect powers in polynomial power sums ⋮ On decompositions of binary recurrent polynomials ⋮ Decomposable polynomials in second order linear recurrence sequences ⋮ On the Diophantine Equation G n (x) = G m (y) with Q (x, y)=0 ⋮ On the Diophantine equation 𝐺_{𝑛}(𝑥)=𝐺_{𝑚}(𝑃(𝑥)): Higher-order recurrences ⋮ Composite values of polynomial power sums ⋮ Diophantine equations between polynomials obeying second order recurrences
This page was built for publication: On the Diophantine equation \(G_{n}(x) = G_{m}(P(x))\)