z-logo
open-access-imgOpen Access
The Diophantine equation 𝛼₁^{π‘₯₁}⋯𝛼_{𝑛}^{π‘₯_{𝑛}}=𝑓(π‘₯₁,…,π‘₯_{𝑛}). II
Author(s) -
Pietro Corvaja,
Wolfgang M. Schmidt,
Umberto Zannier
Publication year - 2009
Publication title -
transactions of the american mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.798
H-Index - 100
eISSN - 1088-6850
pISSN - 0002-9947
DOI - 10.1090/s0002-9947-09-05012-0
Subject(s) - algorithm , annotation , computer science , artificial intelligence
We will deal with the equation of the title where Ξ± 1 , … , Ξ± n \alpha _{1},\dots ,\alpha _{n} are multiplicatively independent complex numbers and f f is a polynomial. We will give a bound for the number of solutions which depends only on n n and the degree of f f . Two further results which play a rΓ΄le in the proof are of independent interest.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here