Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T22:21:55.741Z Has data issue: false hasContentIssue false

Computing the effectively computable bound in Baker's inequality for linear forms in logarithms

Published online by Cambridge University Press:  17 April 2009

A.J. van der Poorten
Affiliation:
School of Mathematics, University of New South Wales, Kensington, New South Wales.
J.H. Loxton
Affiliation:
School of Mathematics, University of New South Wales, Kensington, New South Wales.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

For certain number theoretical applications, it is useful to actually compute the effectively computable constant which appears in Baker's inequality for linear forms in logarithms. In this note, we carry out such a detailed computation, obtaining bounds which are the best known and, in some respects, the best possible. We show inter alia that if the algebraic numbers α1, …, αn all lie in an algebraic number field of degree D and satisfy a certain independence condition, then for some n0(D) which is explicitly computed, the inequalities (in the standard notation)

have no solution in rational integers b1, …, bn (bn ≠ 0) of absolute value at most B, whenever n ≥ n0(D). The very favourable dependence on n is particularly useful.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1976