Upper bounds for the numbers of solutions of unit equations in two unknowns (Q1324837): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3781167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equations in S-units and the Thue-Mahler equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On S-unit equations in two unknowns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate formulas for some functions of prime numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: S-unit equations over number fields / rank
 
Normal rank

Latest revision as of 16:17, 22 May 2024

scientific article
Language Label Description Also known as
English
Upper bounds for the numbers of solutions of unit equations in two unknowns
scientific article

    Statements

    Upper bounds for the numbers of solutions of unit equations in two unknowns (English)
    0 references
    0 references
    19 July 1994
    0 references
    The author considers the equation \(ax + by = 1\), in which the coefficients \(a, b \in \mathbb{C}^*\) and the unknowns \(x\), \(y\) belong to a subgroup \(\Gamma\) of \(\mathbb{C}^*\) of finite rank and computes an explicit upper bound for the number of its solutions. This extends to the most general case an earlier result by \textit{J. H. Evertse} and the author [J. Reine Angew. Math. 358, 6-19 (1985; Zbl 0552.10010)].
    0 references
    0 references
    numbers of solutions
    0 references
    unit equation
    0 references
    subgroup of finite rank
    0 references
    explicit upper bound
    0 references
    0 references