Lehmer problem and applications

Lehmer conjecture predicts a lower bound for the height of a non zero algebraic integer wich is not a root of unity in terms of its degree. In this talk, we explain how the relative Lehmer problem is related to the Zilber-Pink conjecture. The idea comes from the rst article of Bombieri, Masser and Zannier on the subject : they used the lower bounds for the height given by the Lehmer problem to proove that the bounded height subset of Gn m that they were interested in, was nite. Indeed, Lehmer type bounds are used to proove that such a subset has bounded degree and by Northcott property they conlcuded niteness. We'll explain how this argument works in the context of abelian varieties.

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.