1988
DOI: 10.1007/bf01393743
|View full text |Cite
|
Sign up to set email alerts
|

OnS-unit equations in two unknowns

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
46
0

Year Published

1988
1988
2014
2014

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 40 publications
(48 citation statements)
references
References 9 publications
(8 reference statements)
2
46
0
Order By: Relevance
“…Proof. This is Theorem 1 of [17] together with the observation that we may take the triples in A from (&'K \ {0})3 .…”
Section: Ns(o:) = Nk/mentioning
confidence: 70%
See 3 more Smart Citations
“…Proof. This is Theorem 1 of [17] together with the observation that we may take the triples in A from (&'K \ {0})3 .…”
Section: Ns(o:) = Nk/mentioning
confidence: 70%
“…Recently, Evertse, Gyory, Stewart, and Tijdeman [17] proved that almost all equivalence classes of S-unit equations of the form (84) have very few solutions and their result is our next lemma. Proof.…”
Section: Ns(o:) = Nk/mentioning
confidence: 84%
See 2 more Smart Citations
“…Theorem 5 (Evertse, Gyory, Stewart, Tijdeman [26] In this section we shall describe some ideas behind the proofs of Theorems 1 and 2. By the subspace Theorem, the solutions of (4.6) in x E pn-1 (K) are contained in finitely many proper projective subspaces of pn-l (K are finite, we obtain that the total number of solutions of ( 4.3) subject to ( 4.4) is finite.…”
Section: Ves K=omentioning
confidence: 99%