A new approach to Baker's theorem on linear forms in logarithms II

1987 ◽  
pp. 203-211 ◽  
Author(s):  
G. Wüstholz
Keyword(s):  
Linear Forms In Logarithms ◽  
Linear Forms ◽  
New Approach ◽  
Baker's Theorem

scholarly journals Estimating Mahler's measure

1995 ◽  
Vol 51 (1) ◽  
pp. 145-151
Author(s):  
G.R. Everest
Keyword(s):  
Linear Forms In Logarithms ◽  
Algebraic Numbers ◽  
Linear Forms ◽  
Riemann Sums ◽  
Integer Polynomials ◽  
Several Variables ◽  
Logarithmic Integral ◽  
Baker's Theorem

In 1962, Mahler defined a measure for integer polynomials in several variables as the logarithmic integral over the torus. Many results exist about the values taken by the measure but many unsolved problems remain. In one variable, it is possible to express the measure as an effective limit of Riemann sums. We show that the same is true in several variables, using a non-obvious parametrisation of the torus together with Baker's Theorem on linear forms in logarithms of algebraic numbers.

NOTE ON FOURIER–STIELTJES COEFFICIENTS OF COIN-TOSSING MEASURES

2020 ◽  
Vol 102 (3) ◽  
pp. 479-489
Author(s):  
XIANG GAO ◽  
SHENGYOU WEN
Keyword(s):  
Number Theory ◽  
Lower Bound ◽  
Transcendental Number ◽  
Linear Forms In Logarithms ◽  
Multiplicative Semigroup ◽  
Linear Forms ◽  
Coin Tossing

It is known that the Fourier–Stieltjes coefficients of a nonatomic coin-tossing measure may not vanish at infinity. However, we show that they could vanish at infinity along some integer subsequences, including the sequence ${\{b^{n}\}}_{n\geq 1}$ where $b$ is multiplicatively independent of 2 and the sequence given by the multiplicative semigroup generated by 3 and 5. The proof is based on elementary combinatorics and lower-bound estimates for linear forms in logarithms from transcendental number theory.

Applications of Linear Forms in Logarithms

2008 ◽  
pp. 411-440
Author(s):  
Yann Bugeaud ◽  
Guillaume Hanrot ◽  
Maurice Mignotte
Keyword(s):  
Linear Forms In Logarithms ◽  
Linear Forms

scholarly journals Mordell’s equation: a classical approach

2015 ◽  
Vol 18 (1) ◽  
pp. 633-646 ◽  
Author(s):  
Michael A. Bennett ◽  
Amir Ghadermarzi
Keyword(s):  
Lower Bounds ◽  
Diophantine Equation ◽  
Classical Approach ◽  
Linear Forms In Logarithms ◽  
Lattice Basis Reduction ◽  
Linear Forms ◽  
Basis Reduction

We solve the Diophantine equation$Y^{2}=X^{3}+k$for all nonzero integers$k$with$|k|\leqslant 10^{7}$. Our approach uses a classical connection between these equations and cubic Thue equations. The latter can be treated algorithmically via lower bounds for linear forms in logarithms in conjunction with lattice-basis reduction.

The hyperelliptic equation over function fields

1983 ◽  
Vol 93 (2) ◽  
pp. 219-230 ◽  
Author(s):  
R. C. Mason
Keyword(s):  
Elliptic Equation ◽  
Number Field ◽  
Algebraic Number ◽  
Algebraic Number Field ◽  
Linear Forms In Logarithms ◽  
Linear Forms ◽  
Integer Coefficients ◽  
Finite Set ◽  
Integer Solutions ◽  
Explicit Bounds

Siegel, in a letter to Mordell of 1925(9), proved that the hyper-elliptic equation y2 = g(x) has only finitely many solutions in integers x and y, where g denotes a square-free polynomial of degree at least three with integer coefficients. Siegel's method reduces the hyperelliptic equation to a finite set of Thue equations f(x, y) = 1, where f denotes a binary form with algebraic coefficients and at least three distinct linear factors; x and y are integral in a fixed algebraic number field. Siegel had already proved that the Thue equations so obtained have only finitely many solutions. However, as is well known, the work of Siegel is ineffective in that it fails to provide bounds on the integer solutions of y2 = g(x). In 1969 Baker (1), using the theory of linear forms in logarithms, employed Siegel's technique to establish explicit bounds on x and y; Baker's result thus reduced the problem of determining all integer solutions of the hyperelliptic equation to a finite amount of computation.

Sign in / Sign up

Export Citation Format

Share Document