1998
DOI: 10.1016/s0019-3577(98)80001-3
|View full text |Cite
|
Sign up to set email alerts
|

Diophantine equations with power sums and Universal Hilbert Sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

5
85
0

Year Published

1998
1998
2017
2017

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 56 publications
(90 citation statements)
references
References 5 publications
5
85
0
Order By: Relevance
“…(See [NP2,P4].) The situation changed with the papers [CZ1] and [CZ2]. In that papers Corvaja and Zannier proved similar results under quite general conditions.…”
Section: Applications Of Lower Bounds For Linear Forms In Logarithms mentioning
confidence: 96%
See 2 more Smart Citations
“…(See [NP2,P4].) The situation changed with the papers [CZ1] and [CZ2]. In that papers Corvaja and Zannier proved similar results under quite general conditions.…”
Section: Applications Of Lower Bounds For Linear Forms In Logarithms mentioning
confidence: 96%
“…Much more interesting are the results of Corvaja and Zannier [CZ1] and [CZ2]. They considered in [CZ1] LRS with integer characteristic roots and proved: Let G n = g 1 a n 1 + · · · + g k a n k , where k ≥ 2, g 1 , .…”
Section: Proof It Is Well Known Thatmentioning
confidence: 99%
See 1 more Smart Citation
“…Thus, we arrived at the scenario where F b F c + 1 = x 2 has infinitely many integer solutions (b, c, x) with b < c ≤ 4b + 14. Now the Corvaja-Zannier method based on the Subspace Theorem (see [2]) leads to the conclusion that there exists a line parametrized as b = r 1 n + s 1 , c = r 2 n + s 2 for positive integers r 1 , r 2 and integers s 1 , s 2 , such that for infinitely many positive integers n, there exists an integer v n such that…”
Section: Proof Of Theorem 12mentioning
confidence: 99%
“…We take K = Q( √ 5). This is a real quadratic fields with two 1), (1, 2), (1, 3), (1, 4), (2, 0), (2, 1), (2, 2), (2, 3), (3,0), (3,1), (3,2), (4, 0), (4, 1), (5, 0).…”
Section: Proof Of Theorem 12mentioning
confidence: 99%