In mathematics, a real algebraic integer α > 1 is a Salem number if all its conjugate roots have absolute value no greater than 1, and at least one has absolute value exactly 1. Salem numbers are of interest in Diophantine approximation and harmonic analysis. They are named after Raphaël Salem.

Properties

Because it has a root of absolute value 1, the minimal polynomial for a Salem number must be reciprocal. This implies that 1/|α| is also a root, and that all other roots have absolute value exactly one. As a consequence α must be a unit in the ring of algebraic integers, being of norm 1.

Relation with Pisot–Vijayaraghavan numbers

The smallest known Salem number is the largest real root of Lehmer's polynomial (named after Derrick Henry Lehmer)

\( P(x) = x^{10} + x^9 -x^7 -x^6 -x^5 -x^4 -x^3 +x +1, \)

which is about x = 1.17628. It is a factor of the shorter 12th-degree polynomial,

\( Q(x) = x^{12} - x^7 - x^6 - x^5 + 1, \)

If Q(x) = 0, then all twelve roots satisfies the amazing relation,[1]

\( x^{630}-1 = \frac{(x^{315}-1)(x^{210}-1)(x^{126}-1)^2(x^{90}-1)(x^{3}-1)^3(x^{2}-1)^5(x-1)^3 }{(x^{35}-1)(x^{15}-1)^2(x^{14}-1)^2(x^{5}-1)^6\,x^{68}} \)

Salem numbers can be constructed from Pisot–Vijayaraghavan numbers. To recall, the smallest of the latter is the unique real root of the cubic polynomial,

\( x^3 - x - 1, \)

known as the plastic number and approximately equal to 1.324718. This can be used to generate a family of Salem numbers including the smallest one found so far. The general approach is to take the minimal polynomial P(x) of a Pisot–Vijayaraghavan number and its reciprocal polynomial, P*(x), to form the equation,

\( x^n P(x) = \pm P^{*}(x) \, \)

for integral n above a bound. Subtracting one side from the other, factoring, and disregarding trivial factors will then yield the minimal polynomial of certain Salem numbers. For example, using the negative case of the above,

\( x^n(x^3-x-1) = -(x^3+x^2-1) \)

then for n = 8, this factors as,

\( (x-1)(x^{10} + x^9 -x^7 -x^6 -x^5 -x^4 -x^3 +x +1) = 0 \)

where the decic is Lehmer's polynomial. Using higher n will yield a family with a root approaching the plastic number. This can be better understood by taking nth roots of both sides,

\( x(x^3-x-1)^{1/n} = \pm (x^3+x^2-1)^{1/n} \)

so as n goes higher, x will approach the solution of \( x^3-x-1 = 0 \). If the positive case is used, then x approaches the plastic number from the opposite direction. Using the minimal polynomial of the next smallest Pisot–Vijayaraghavan number gives,

\( x^n (x^4-x^3-1) = -(x^4+x-1) \)

which for n = 7 factors as,

\( (x-1)(x^{10} -x^6 -x^5 -x^4 +1) = 0 \)

a decic not generated in the previous and has the root x = 1.216391... which is the 5th smallest known Salem number. As n → infinity, this family in turn tends towards the larger real root of \( x^4-x^3-1=0. \)

See also

Mahler measure

References

^ D. Bailey and D. Broadhurst, A Seventeenth Order Polylogarithm Ladder

Borwein, Peter (2002). Computational Excursions in Analysis and Number Theory. CMS Books in Mathematics. Springer-Verlag. ISBN 0-387-95444-9. Chap. 3.

Boyd, David (2001), "Salem number", in Hazewinkel, Michiel, Encyclopedia of Mathematics, Springer, ISBN 978-1556080104

M.J. Mossinghoff. "Small Salem numbers". Retrieved 2007-01-21.

Retrieved from "http://en.wikipedia.org/"

All text is available under the terms of the GNU Free Documentation License