On Thue's equation (Q1820195): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3663376 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3665191 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the representations of numbers by binary cubic forms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the representation of integers by binary forms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An inequality for the discriminant of a polynomial / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Thue's theorem. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Representations of integers by binary forms and the rank of the Mordell- Weil group / rank | |||
Normal rank |
Latest revision as of 17:58, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On Thue's equation |
scientific article |
Statements
On Thue's equation (English)
0 references
1987
0 references
In this very interesting paper the authors consider the number \(N(F,h)\) of solutions of Thue's equation \(F(x,y)=h\) in integers \(x,y\in\mathbb{Z}\) with \((x,y)=1\). Here, \(F\in\mathbb{Z}[x,y]\) is a binary form of degree \(r\ge 3\) and h is fixed. In 1983 J. H. Evertse was the first to give a bound for \(N(F,h)\) depending only on \(r\) and \(h\), but independent of the coefficients of \(F\). The dependence on \(r\) is of the form \(\exp(r^2)\). In the present paper the authors give a vast improvement of Evertse's theorem. They show \(N(F,h)<c_1r^{1+t}\), where \(t\) is the number of distinct prime divisors of \(h\) and \(c_1\) is some computable constant which is \(<215\) if \(r\) is big enough. In case \(h=1\) this bound is optimal in its dependence on \(r\), since \(x^r+(y-x)(y-2x) \cdots (y-rx)=1\) obviously has at least \(r\) solutions. The proof starts with the case \(h=1\) and then, by induction on \(t\), is extended to general \(h\). To bound the number of large solutions the classical Thue-Siegel method is used. For the small solutions the authors first split the original problem in a union of Thue equations with large discriminant and then use some ingenious proximity arguments to finish the proof.
0 references
upper bounds
0 references
primitive solutions
0 references
Thue equation
0 references
binary form of higher degree
0 references
large solutions
0 references
small solutions
0 references