Diophantine equations in separated variables and polynomial power sums (Q2049537): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1007/s00605-021-01560-6 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S00605-021-01560-6 / rank
 
Normal rank

Latest revision as of 21:31, 16 December 2024

scientific article
Language Label Description Also known as
English
Diophantine equations in separated variables and polynomial power sums
scientific article

    Statements

    Diophantine equations in separated variables and polynomial power sums (English)
    0 references
    0 references
    0 references
    27 August 2021
    0 references
    Diophantine equations in separated variables of type \(f(x)=g(y)\) are well-known in the literature, cf. \textit{R. F. Tichy} and \textit{D. Kreso} [Period. Math. Hung. 76, No. 1, 47--67 (2018; Zbl 1399.11105)]. To solve equations of this type, a powerful tool is the application of the result of \textit{Y. F. Bilu} and \textit{R. F. Tichy} [Acta Arith. 95, No. 3, 261--288 (2000; Zbl 0958.11049)]. Let \(G_n(x)=a_1\alpha_1(x)^n+\ldots+a_d\alpha_d(x)^n\) be the \(n\)-th term in a linear recurrence sequence of polynomials, let \(H_m(y)=b_1\beta_1(y)^n+\ldots+b_t\beta_t(x)^n\) be the \(m\)-th term in another linear recurrence sequence of polynomials. Under certain assumptions the authors prove: -- if \(G_n(x)\) is indecomposable, then \(G_n(x)=H_m(y)\) has infinitely many rational solutions if and only if there exists a polynomial \(P(y)\in\mathbb Q[y]\) such that \(H_m(y)=G_n(P(y))\) holds identically. -- if in addition \(H_m(y)\) is also indecomposable, then in the above statement we can restrict \(P(y)\) to be linear.
    0 references
    Diophantine equation
    0 references
    Bilu-Tichy theorem
    0 references
    linear recurrences
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references