On the resolution of Thue inequalities (Q579295): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Contributions to the theory of diophantine equations I. On the representation of integers by binary forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diophantine equation \(y^2+k=x^3\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5646971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5582389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Products of Prime Powers in Binary Recurrence Sequences Part II: The Elliptic Case, with an Application to a Mixed Quadratic-Exponential Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916641 / rank
 
Normal rank

Latest revision as of 11:05, 18 June 2024

scientific article
Language Label Description Also known as
English
On the resolution of Thue inequalities
scientific article

    Statements

    On the resolution of Thue inequalities (English)
    0 references
    1987
    0 references
    The author describes a practical method to find all solutions to the inequality \[ | F(x,y)| \leq m\qquad\text{in}\;x,y\in\mathbb Z \tag{*} \] with \((x,y)=1\), where \(F(X,Y)\in\mathbb Z[X,Y]\) is a homogeneous polynomial of degree \(n\geq 3\) which is irreducible over \(\mathbb Q[X,Y]\) and \(m\) is a positive integer. Using a result of \textit{A. Baker} [Philos. Trans. R. Soc. Lond., Ser. A 263, 173--191 (1968; Zbl 0157.09702)] one can compute a number \(y_ 0\), depending on \(F\) and \(m\), such that \(| y| \leq y_ 0\) for each solution \((x,y)\) to (*). Unfortunately, this bound \(y_ 0\) is too large to be of any practical help in the resolution of (*). The author develops a method to reduce a given upper bound \(y_ 0\) for \(| y|\) to a much smaller upper bound for \(| y|\). His method uses the continued fraction expansions of the zeros of \(F(x,1)\): assuming that the partial quotients of the zeros of \(F(x,1)\) grow at most polynomially whereas the denominators of their convergents grow exponentially, the author's method reduces the bound \(y_ 0\) to a bound which is at most a power of \(\log y_ 0\). As an application of his method the author solves the inequality \[ | x^3+x^2y-2xy^2-y^3| \leq 200,\qquad | y| \leq 10^{500} \] in integers \(x,y\) with \((x,y)=1\).
    0 references
    0 references
    0 references
    0 references
    0 references
    Thue equations
    0 references
    practical method
    0 references
    continued fraction expansions
    0 references
    0 references