where factorizes over the complex numbers as
By extension, the Mahler measure of an algebraic number is defined as the Mahler measure of the minimal polynomial of over . In particular, if is a Pisot number or a Salem number, then its Mahler measure is simply .
- The Mahler measure is multiplicative:
- where is the norm of .
- Kronecker's Theorem: If is an irreducible monic integer polynomial with , then either or is a cyclotomic polynomial.
- (Lehmer's conjecture) There is a constant such that if is an irreducible integer polynomial, then either or .
- The Mahler measure of a monic integer polynomial is a Perron number.
Higher-dimensional Mahler measure
It inherits the above three properties of the Mahler measure for a one-variable polynomial.
where is the Dirichlet L-function, and
where is the Riemann zeta function. Here is called the logarithmic Mahler measure.
Some results by Lawton and Boyd
From the definition, the Mahler measure is viewed as the integrated values of polynomials over the torus (also see Lehmer's conjecture). If vanishes on the torus , then the convergence of the integral defining is not obvious, but it is known that does converge and is equal to a limit of one-variable Mahler measures, which had been conjectured by Boyd.
This is formulated as follows: Let denote the integers and define . If is a polynomial in variables and define the polynomial of one variable by
and define by
Theorem (Lawton) : Let be a polynomial in N variables with complex coefficients. Then the following limit is valid (even if the condition that is relaxed):
Boyd provided more general statements than the above theorem. He pointed out that the classical Kronecker's theorem, which characterizes monic polynomials with integer coefficients all of whose roots are inside the unit disk, can be regarded as characterizing those polynomials of one variable whose measure is exactly 1, and that this result extends to polynomials in several variables.
Define an extended cyclotomic polynomial to be a polynomial of the form
where is the m-th cyclotomic polynomial, the are integers, and the are chosen minimally so that is a polynomial in the . Let be the set of polynomials that are products of monomials and extended cyclotomic polynomials.
Theorem (Boyd) : Let be a polynomial with integer coefficients. Then if and only if is an element of .
This led Boyd to consider the set of values
and the union . He made the far-reaching conjecture that the set of is a closed subset of . An immediate consequence of this conjecture would be the truth of Lehmer's conjecture, albeit without an explicit lower bound. As Smyth's result suggests that , Boyd further conjectures that
- Borwein, Peter (2002). Computational Excursions in Analysis and Number Theory. CMS Books in Mathematics. 10. Springer. pp. 3, 15. ISBN 978-0-387-95444-8. Zbl 1020.12001.
- Boyd, David (1981a). "Speculations concerning the range of Mahler's measure". Canad. Math. Bull. 24 (4): 453–469. doi:10.4153/cmb-1981-069-5.
- Boyd, David (1981b). "Kronecker's Theorem and Lehmer's Problem for Polynomials in Several Variables". Journal of Number Theory. 13: 116–121. doi:10.1016/0022-314x(81)90033-0.
- Boyd, David (2002a). "Mahler's measure and invariants of hyperbolic manifolds". In Bennett, M. A. (ed.). Number theory for the Millenium. A. K. Peters. pp. 127–143.
- Boyd, David (2002b). "Mahler's measure, hyperbolic manifolds and the dilogarithm". Canadian Mathematical Society Notes. 34 (2): 3–4, 26–28.
- Boyd, David; Rodriguez Villegas, F. (2002). "Mahler's measure and the dilogarithm, part 1". Canadian Journal of Mathematics. 54 (3): 468–492. doi:10.4153/cjm-2002-016-9.
- Hazewinkel, Michiel, ed. (2001) , "Mahler measure", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4.
- Jensen, J.L. (1899). "Sur un nouvel et important théorème de la théorie des fonctions". Acta Mathematica. 22: 359–364. doi:10.1007/BF02417878. JFM 30.0364.02.
- Knuth, Donald E. (1997). "4.6.2 Factorization of Polynomials". Seminumerical Algorithms. The Art of Computer Programming. 2 (3rd ed.). Addison-Wesley. pp. 439–461, 678–691. ISBN 978-0-201-89684-8.
- Lawton, Wayne M. (1983). "A problem of Boyd concerning geometric means of polynomials". Journal of Number Theory. 16 (3): 356–362. doi:10.1016/0022-314X(83)90063-X. Zbl 0516.12018.
- Mossinghoff, M.J. (1998). "Polynomials with Small Mahler Measure". Mathematics of Computation. 67 (224): 1697–1706. doi:10.1090/S0025-5718-98-01006-0. Zbl 0918.11056.
- Schinzel, Andrzej (2000). Polynomials with special regard to reducibility. Encyclopedia of Mathematics and Its Applications. 77. Cambridge University Press. ISBN 978-0-521-66225-3. Zbl 0956.12001.