← All problems

Lehmer's problem on the Mahler measure

93 years old · traced to

For a nonzero polynomial P(x)=ad∏i=1d(x−αi)∈C[x]P(x)=a_d\prod_{i=1}^d(x-\alpha_i)\in\mathbb C[x], with roots listed with multiplicity, the Mahler measure is

M(P)=∣ad∣∏i=1dmax⁡(1,∣αi∣).M(P)=|a_d|\prod_{i=1}^d\max\bigl(1,|\alpha_i|\bigr).

For an algebraic number α\alpha, set M(α)=M(Pα)M(\alpha)=M(P_\alpha), where Pα∈Z[x]P_\alpha\in\mathbb Z[x] is the minimal polynomial of α\alpha with coprime coefficients and positive leading coefficient. If P∈Z[x]P\in\mathbb Z[x] is nonzero, then M(P)≥1M(P)\ge1. By Kronecker's theorem, an algebraic integer α≠0\alpha\ne0 has M(α)=1M(\alpha)=1 exactly when α\alpha is a root of unity.

Lehmer's problem. Does there exist an absolute constant c>0c>0 such that

M(α)≥1+cM(\alpha)\ge1+c

for every nonzero algebraic integer α\alpha that is not a root of unity?

Equivalently: is there μ>1\mu>1 such that every P∈Z[x]P\in\mathbb Z[x] with M(P)>1M(P)>1 satisfies M(P)≥μM(P)\ge\mu? Lehmer's conjecture asserts that the answer is yes. A solution must settle the question, either by proving such a cc exists or by producing algebraic integers αk\alpha_k, none a root of unity, with M(αk)→1M(\alpha_k)\to1. The smallest known value above 11 is attained by Lehmer's polynomial

L(x)=x10+x9−x7−x6−x5−x4−x3+x+1,M(L)=1.17628081…,L(x)=x^{10}+x^9-x^7-x^6-x^5-x^4-x^3+x+1,\qquad M(L)=1.17628081\ldots ,

and a stronger form of the conjecture says that M(L)M(L) is the optimal value of 1+c1+c. [1, 6, 7]

Background

Lehmer raised the question in 1933 while generalizing Mersenne numbers [1]. For a monic integer polynomial PP with roots αi\alpha_i, he studied the integers Δn=∏i(αin−1)\Delta_n=\prod_i(\alpha_i^n-1). These grow roughly like M(P)nM(P)^n, so polynomials with small measure give slowly growing sequences that are more likely to contain primes. He found L(x)L(x) in this search and asked whether measures can come arbitrarily close to 11.

The problem is now central in the theory of heights. The quantity log⁡M(α)/deg⁡α\log M(\alpha)/\deg\alpha is the absolute logarithmic Weil height of α\alpha, so Lehmer's problem asks for a lower bound on the height of order 1/deg⁡α1/\deg\alpha. Small Mahler measures are also tied to Salem numbers, since M(L)M(L) is a Salem number, and to dynamics: the topological entropy of an automorphism of a torus equals the logarithm of the Mahler measure of its characteristic polynomial. Smyth's survey treats these connections [6].

Equivalent formulations
  1. Let h\mathrm{h} denote the absolute logarithmic Weil height, let Q‾∗\overline{\mathbb{Q}}^* be the multiplicative group of nonzero algebraic numbers, and let μ∞\mu_\infty be the set of roots of unity in Q‾\overline{\mathbb{Q}}. Lehmer's conjecture. There exists a constant c>0c>0 such that, for every x∈Q‾∗\μ∞x\in\overline{\mathbb{Q}}^*\backslash\mu_\infty, one has

    h(x)≥c[Q(x):Q].\mathrm{h}(x)\geq\frac{c}{[\mathbb{Q}(x):\mathbb{Q}]}.

    This is a central open problem concerning lower bounds for the Weil height; it asserts a uniform inverse-degree lower bound away from roots of unity.

    source: Arnaud Plessis, “Minoration de la hauteur de Weil dans un compositum de corps de rayon”, arXiv:1805.11879 (2019).

  2. Lehmer's conjecture, also known as the Lehmer's Mahler measure problem, is a problem in number theory raised by Derrick Henry Lehmer. The conjecture asserts that there is an absolute constant μ>1\mu >1 such that every polynomial with integer coefficients P(x)∈Z[x]P(x)\in \mathbb {Z} [x] satisfies one of the following properties: The Mahler measure M(P(x)){\mathcal {M}}(P(x)) of P(x)P(x) is greater than or equal to μ\mu. P(x)P(x) is an integral multiple of a product of cyclotomic polynomials or the monomial xx, in which case M(P(x))=1{\mathcal {M}}(P(x))=1.

    source: Wikipedia

References
  1. D. H. Lehmer, "Factorization of certain cyclotomic functions", Ann. of Math. 34 (1933). doi:10.2307/1968172
  2. C. J. Smyth, "On the product of the conjugates outside the unit circle of an algebraic integer", Bull. London Math. Soc. 3 (1971), 169–175. doi:10.1112/blms/3.2.169
  3. E. Dobrowolski, "On a question of Lehmer and the number of irreducible factors of a polynomial", Acta Arith. 34 (1979), 391–401. doi:10.4064/aa-34-4-391-401
  4. P. Voutier, "An effective lower bound for the height of algebraic numbers", Acta Arith. 74 (1996), 81–95. doi:10.4064/aa-74-1-81-95
  5. V. Dimitrov, "A proof of the Schinzel–Zassenhaus conjecture on polynomials", preprint (2019). arXiv:1912.12545
  6. C. Smyth, "The Mahler measure of algebraic numbers: a survey", in Number Theory and Polynomials, London Math. Soc. Lecture Note Ser., Cambridge Univ. Press (2008), 322–349. doi:10.1017/CBO9780511721274.021, arXiv:math/0701397
  7. Wikipedia, Lehmer's conjecture.

Source: Wikipedia

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.