2010
DOI: 10.1007/s00013-010-0111-7
|View full text |Cite|
|
Sign up to set email alerts
|

On the length of arithmetic progressions in linear combinations of S-units

Abstract: Abstract. Recent finiteness results concerning the lengths of arithmetic progressions in linear combinations of elements from finitely generated multiplicative groups have found applications to a variety of problems in number theory. In the present paper, we significantly refine the existing arguments and give an explicit upper bound on the length of such progressions.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…The next result is Theorem 1.1 of Hajdu and Luca in [8]. For the first (non-explicit) result of this type see also [7].…”
Section: Proofs Of the Other Theoremsmentioning
confidence: 88%
“…The next result is Theorem 1.1 of Hajdu and Luca in [8]. For the first (non-explicit) result of this type see also [7].…”
Section: Proofs Of the Other Theoremsmentioning
confidence: 88%
“…is the constant appearing in the conclusion of Matveev's theorem (10) when Λ involves r = + 2 rational numbers (r = + 2 and D = 1). Now we show that…”
Section: T)mentioning
confidence: 99%
“…For related problems and results see e.g. the papers [1,2,5,10,11,12,18] and the references therein.…”
Section: Introductionmentioning
confidence: 99%