1996
DOI: 10.4064/aa-78-2-189-199
|View full text |Cite
|
Sign up to set email alerts
|

The equation x+y=1 in finitely generated groups

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
84
0
4

Year Published

1998
1998
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 65 publications
(89 citation statements)
references
References 4 publications
1
84
0
4
Order By: Relevance
“…Let K be a discrete valuation field with ring of integers O K , uniformizer π, and residue field k. Let E/K be an elliptic curve given by a Weierstrass equation 4 , and a 6 . Then the condition to have multiplicative reduction is that π a 2 1 + 4a 2 (we set as usual b 2 := a 2 1 + 4a 2 ).…”
Section: 2mentioning
confidence: 99%
See 2 more Smart Citations
“…Let K be a discrete valuation field with ring of integers O K , uniformizer π, and residue field k. Let E/K be an elliptic curve given by a Weierstrass equation 4 , and a 6 . Then the condition to have multiplicative reduction is that π a 2 1 + 4a 2 (we set as usual b 2 := a 2 1 + 4a 2 ).…”
Section: 2mentioning
confidence: 99%
“…Let K be a number field. Let A, B ∈ K * , and consider the equation [4], and [22] (1.5)). We will apply this bound in this section for the equation X − Y = 1.…”
Section: 3mentioning
confidence: 99%
See 1 more Smart Citation
“…Here, Schlickewei [4] proved the conjecture to be true. His bound has been improved by Beukers and Schlickewei [1]. They showed that for q = 3 equation (1.1) does not have more than 61 solutions.…”
Section: (12)mentioning
confidence: 99%
“…Our approach is similar to that of Birch and Merriman [2], with the necessary modifications. In our proofs we use among other things an upper bound by Beukers and Schlickewei [1,Theorem 1] for the numbers of solutions of the equation x + y = 1 in unknowns x, y from a multiplicative group of finite rank.…”
mentioning
confidence: 99%