Lp\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L^{p}$$\end{document}-Norms and Mahler’s Measure of Polynomials on the n-Dimensional Torus

We prove Nikol’skii type inequalities that, for polynomials on the n-dimensional torus Tn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {T}^n$$\end{document}, relate the Lp\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L^p$$\end{document}-norm with the Lq\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L^q$$\end{document}-norm (with respect to the normalized Lebesgue measure and 0<p<q<∞\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$0 <p <q < \infty $$\end{document}). Among other things, we show that C=q/p\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C=\sqrt{q/p}$$\end{document} is the best constant such that ‖P‖Lq≤Cdeg(P)‖P‖Lp\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Vert P\Vert _{L^q}\le C^{\text {deg}(P)} \Vert P\Vert _{L^p}$$\end{document} for all homogeneous polynomials P on Tn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {T}^n$$\end{document}. We also prove an exact inequality between the Lp\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L^p$$\end{document}-norm of a polynomial P on Tn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {T}^n$$\end{document} and its Mahler measure M(P), which is the geometric mean of |P| with respect to the normalized Lebesgue measure on Tn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {T}^n$$\end{document}. Using extrapolation, we transfer this estimate into a Khintchine–Kahane type inequality, which, for polynomials on Tn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {T}^n$$\end{document}, relates a certain exponential Orlicz norm and Mahler’s measure. Applications are given, including some interpolation estimates.


Introduction
The Mahler measure of a polynomial P on C n is given by where dz = dz 1 . . . dz n stands for the normalized Lebesgue measure on the n-torus T n . Thus M(P) is the geometric mean of P over the n-torus T n (we define M(0) = 0). We point out that Mahler [14] used the functional M as a powerful tool in a simple proof of the "Gelfond-Mahler inequality," which found important applications in transcendence theory. It seems that the Mahler measure for polynomials in one complex variable appears the first time in Lehmer [13], where it is proved that if P(z) = m k=0 a k z k , z ∈ C with a m = 0 and zeros α 1 , . . . , α m ∈ C, then Let us also recall the following crucial multiplicativity property of the Mahler measure M: For two polynomials P and Q on C n ,

M(P Q) = M(P)M(Q).
The following inequality due to Arestov [2] is a key result for this article (first results in this direction are due Mahler [14] and Duncan [11]): For every polynomial P in one complex variable and of degree deg(P) ≤ m, and every 0 < p < ∞, we have where ( p, m) := T |1 + z| mp dz 1/ p = 2 m π −1/2 p 2 −1 (mp + 1) By definition, we have that P L p (T) = ( p, m) for the polynomial P(z) = (1 + z) m , z ∈ C, and moreover, by (2), that M(P) = 1, which implies that (4) is sharp. Arestov [2] proved, using asymptotic formulas for the -function, that for fixed p > 0, Throughout the paper, we will use standard notation; some nonstandard notation will be given locally. Let P(K n ) be the space of all polynomials P on K n , where K = R or K = C; i.e., Here the sum is taken over finitely many multi indices α = (α 1 , . . . , α n ) ∈ N n 0 , and z α := z α 1 1 . . . z α n n denotes the αth monomial. As usual, |α| = n j=1 α j , and we call the total degree of P. If m = deg(P) and all monomial coefficients c α = c α (P) = 0 for all |α| < m, then P is said to be m-homogeneous. For every polynomial P ∈ P(K n ) and (u 1 , . . . , u n ) ∈ K n , the degree of the one-variable polynomial Finally, in contrast to (6), we write The following extension of (4), a sharp Khintchine-Kahane type inequality that allows one to estimate the L p (T n )-norm P L p (T n ) of P ∈ P(C n ) by its Mahler measure M(P), was the starting point of this article, and will be proved in Sect. 3: For every P ∈ P(C n ) and every 0 < p < ∞, In view of (1), this inequality can be seen as a limit case of Khintchine-Kahane type inequalities relating, for 0 < p < q < ∞, the L q (T n )-norm of P ∈ P(C n ) to its L p (T n )-norm. The study of L p -norms of polynomials has a rich history, and in Sect. 2, we give new information in this direction. Recently, there has been a considerable interest in the behavior of the constants of Khintchine-Kahane type equivalences · L p ≈ · L q in the case when L p -spaces are considered on arbitrary unit-volume convex bodies K in R n ; see, e.g., the work of Gromov-Milman [12] and Bourgain [8]. We also mention [6], where it is proved that if μ is an arbitrary log-concave probability measure μ on R n , then, for all 1 ≤ p < ∞ and all P ∈ P(R n ), we have A Borel probability measure μ on R n is said to be log-concave whenever μ is supported by some affine subspace E, where it has a log-concave density u : E → [0, ∞) (i.e., ln u is concave) with respect to the Lebesgue measure on E. The inequality in (8) implies that on P(R n ) all L p (μ)-norms are equivalent with constants which are independent of n and depend only on deg ∞ (P) and p. Replacing R n by C n , a wellknown inequality due to Nikol'skii (see [18,19]) states that for every P ∈ P(C n ) and 0 < q < p < ∞, Such inequalities are called Nikol'skii inequalities or different metrics inequalities.
There is an extensive literature on such inequalities; we refer to the monographs [10,17], and [21]. Recall the following important result from Weissler's article [22, Corollary 2.1] on the hypercontractivity of convolution with the Poisson kernel in Hardy spaces: Given 0 < p < q < ∞, the constant r = p q is the best constant 0 < r ≤ 1 such that for every P ∈ P(C), In [4, Theorem 9] Bayart used a standard iteration argument through Fubini's theorem in order to extend (10) to polynomials in several variables: The constant r = p q is the best constant 0 < r ≤ 1 such that for every P ∈ P(C n ), we have T n P(r z) q dz in particular, for every homogeneous polynomial P ∈ P(C n ), This Khintchine-Kahane type inequality extends earlier work of Beauzamy et al. from [5] (p = 2 < q and p < q = 2) and Bonami [7] (q = 2, p = 1). The striking fact is that the constants involved in (12) are independent of the dimension n, while they grow exponentially with the degree deg(P). On the other hand, the constants in (9) approach infinity as n tends to infinity. In Sect. 2 we supply more information on (12). We show that the constant C = q p in this inequality is best possible, and moreover it even holds for all polynomials P ∈ P(C n ) (not necessarily homogeneous). This will follow by Proposition 2.1, a result based on private communication with S. Kwapień and here published with his permission. Several interesting applications are in order-some motivated by the original work of Mahler and his followers.

L p -Norms Versus L q -Norms of Polynomials on T n
The following Khintchine-Kahane type inequality is the main result of this section.
(i) For each n ∈ N and every P ∈ P(C n ), we have with C = q p , here the constant C = q p is best possible which is an immediate consequence of the following statement. (ii) The best possible constant C = C( p, q) such that for each n, m ∈ N and every m-homogeneous polynomial P ∈ P(C n ) we have As mentioned in the discussion preceeding inequality (12), the upper estimate (ii) is due to Bayart [4]; see also [5 . Before turning to the proof of Theorem 2.1, let us note that the strategy for the proof will be as follows: we first prove statement (i), and in the final part of this section, we turn to the proof of statement (ii) based on Kwapień Proposition 2.1.

Proof of statement (i) in Theorem 2.1
For a given polynomial P(w) = α∈N n 0 c α w α ∈ P(C n ), we define the polynomial Q ∈ P(C n+1 ) given by Clearly, Q is m-homogeneous with m = deg(P) and for every 0 < r < ∞, we have (by rotation invariance of the Lebesgue measure on T n ) Then statement (i) follows from (12).
The proof of statement (ii) in Theorem 2.1 will be a consequence of the following proposition due to Kwapień. We need some more notation: for fixed 0 < p < q < ∞ and m ∈ N, let C( p, q; m) be the best constant such that holds for all m-homogeneous polynomials P ∈ P(C n ) which are affine in each variable (i.e., all m-homogeneous polynomials with deg ∞ (P) = 1).
where the symbol means that the terms are equal up to constants only depending on p and q.
Using the estimate (12) for homogeneous polynomials, we immediately obtain the required upper estimate. The proof of the lower bound in (14) needs a bit more preparation. For each k, n ∈ N with k ≤ n, define the following two k-homogeneous polynomials on C n : In the literature, e k,n and p k,n are called the k-th elementary symmetric and the k-th power symmetric polynomial, respectively. It is known that where and the sum extends over all j 1 , . . . , j k ∈ N 0 with j 1 + 2 j 2 + · · · + k j k = k, and at least one of the indices j 2 , . . . , j k is not zero. Note that there is a recursive formula for the coefficients a j 1 ,..., j k (seemingly due to Newton). Then for each 0 < p < ∞, we have that Hereafter, we treat the z i , 1 ≤ i ≤ n as random variables on the probability space T n ; we consider z i : T n → C, (z j ) → z i (called Steinhaus random variables, i.e., independent identically distributed random variables on a probability measure space, uniformly distributed on T). By the central limit theorem (see, e.g., [1]), the sequence Q 1,n converges in distributions, as n → ∞, to a canonical complex Gaussian random variable G, and for each t > 0, there is C t > 0 such that for all n, we have Since the random variable Q k,n is distributed the same as Q 1,n n − k−1 2 for each k, n ∈ N (because z k i is distributed the same as z i ), it follows that for each k ∈ N and every t > 0, we have lim n→∞ E Q k,n t = 0.
which is the desired estimate.
We finish by completing the proof of Theorem 2.1.

L p -Norms Versus Mahler's Measure for Polynomials on T n
Based on Arestov's estimate (4), we prove an exact inequality between the L p -norm of a polynomial P on T n and its Mahler measure M(P).
Proof We use induction with respect to n. The inequality is true for n = 1 by Arestov's result from (4). Fix a positive integer n ≥ 2, and assume that the inequality is true for n − 1. We fix a sequence (q k ) of positive real numbers such that 0 < q k < min{1, p} for each k ∈ N and q k ↓ 0, and write for 1 ≤ k ≤ n, Combining Fubini's theorem with Jensen's inequality and the definition (1) gives, by the inductive hypothesis, It now follows by Fatou's lemma and (the continuous) Minkowski's integral inequality (we have 0 < pq k < p for each k ∈ N), Then by Arestov's estimate from (4), we obtain that which by another application of the inductive hypothesis and Fubini's theorem finally leads to the desired estimate, It remains to check the comment on the sharpness of the inequality. By Fubini's theorem and the definition of ( p, d j ) from (5), we immediately see that P L p (T n ) = n j=1 ( p, d j ). On the other hand, the multiplicativity property (3) of the Mahler measure gives that M(P) = n j=1 M(P j ) = 1, where the latter equality follows from (2). This completes the proof.
We conclude this section with a simple corollary. Corollary 3.1 For every P ∈ P(C n ) with m = deg ∞ (P), and every 0 < p < ∞, we have Proof Fix p > 0. Substituting the polynomial P ≡ 1 into (4) yields 1 ≤ ( p, m) for each m ∈ N. Since ( p, m) is the least constant in inequality (4) and the class of polynomials becomes larger as m grows, it follows that ( p, k 1 ) ≤ ( p, k 2 ) provided k 1 < k 2 . Now if P ∈ P(C n ) with deg ∞ (P) = m, then d j := deg(P j ) ≤ m for each 1 ≤ j ≤ n, and so n j=1 ( p, d j ) ≤ ( p, m) n . Thus the required estimate follows from Theorem 3.1.

Applications
In the final section, we discuss some applications of our previous results. The first one is motivated by a result due to Bourgain [8] (answering affirmatively a question by Milman), which states that there are universal constants t 0 > 0 and c ∈ (0, 1) such that, for every convex set K ⊂ R n of volume one and every P ∈ P(R n ), the following distribution inequality holds: where μ K is the Lebesgue measure on K and f 1 is the L 1 -norm of P with respect to μ K . It is known that such inequalities may be rewritten in terms of the Orlicz space L ψ α (K ) generated by the convex function ψ α (t) = exp(t α ) − 1, t ≥ 0, as follows: where α = c/n and C > 0 is some absolute constant. We recall that for a given convex function ϕ : [0, ∞) → [0, ∞) with ϕ −1 ({0}) = {0} and any measure space ( , , μ), the Orlicz space L ϕ ( ) is defined to be the space of all complex functions f ∈ L 0 (μ) such that ϕ(λ| f |) dμ < ∞ for some λ > 0, and it is equipped with the norm Now, using an extrapolation trick, we will prove a variant of (17), but for polynomials on the n-torus T n instead of R n . We will use Corollary 3.1 to deduce the following Khintchine-Kahane type inequality relating, for polynomials on the n-torus, a corresponding exponential Orlicz norm and Mahler's measure. Theorem 4.1 For every P ∈ P(C n ) with m = deg ∞ (P), we have Proof Observe that the integral form of ( p, m) given in (5) implies that for each k ∈ N, Now fix P ∈ P(C n ). Combining the above inequality with Corollary 3.1 (for Recall that ψ 1/m (t) = exp(t 1/m ) − 1 for all t ≥ 0. Then, using Taylor's expansion and (18), we obtain that Hence, by the definition of the norm in the Orlicz space L ψ 1/m (T n ), we get and this completes the proof.
The final applications are motivated by some interesting results from the remarkable article [16]. To explain these results, following [16], for a given polynomial P ∈ P(C n ), we define In [16], Mahler established a number of inequalities connecting L(P), H (P), and M(P), and showed applications to estimates of P L 2 (T n ) in terms of L(P), H (P), or M(P). A series of papers studies this and related problems, in particular, the problem of finding norm estimates where · is some norm on P(C n ), P, Q ∈ P(C n ), and C a constant depending only on the degrees of P, Q; see, e.g., [5,11,16].
It was proved by Duncan [11,Theorem 3] that if P, Q ∈ P(C) with m = deg(P) and k = deg(Q), then Below we present a more general multidimensional variant that estimates the L pnorms of products of polynomials over the n-torus T n also in the quasi-Banach case, i.e., 0 < p < 1.
In [15], Mahler proved the following univariate "triangle inequality": with the constant κ(m) = 2 m , where deg(P) = deg(Q) = m, and he observed that it has applications in the theory of diophantine approximation. Duncan [11] obtained the above inequality with the smaller constant We refer the reader to the paper [3] of Arestov, which contains a refinement of these results for algebraic polynomials on the unit circle; more precisely, the following two-sided estimates: are obtained, where m ≥ 6, R = 6 √ 40 ≈ 1,8493 and r = exp(2G/π ) ≈ 1,7916 with G = ∞ ν=0 (−1) ν /(2ν + 1) 2 . We have the following multidimensional variant of Duncan's result: We conclude the paper with an interpolation inequality for L p -norms of polynomials on T n that is interesting in its own right; here for a given measure space ( , , μ), E ∈ with μ(E) > 0, and 0 < p < ∞, we write f L p (E) := Theorem 4.2 Let E be a Lebesgue measurable subset of T n with λ n (E) ≥ θ > 0. Then the following interpolation inequality holds for any polynomial P ∈ P(C n ) with deg ∞ (P) = m and any 0 < p < ∞: P L p (T n ) ≤ C(θ ) ( p, m) n P L 1 (T n ) where C(θ ) = 1 θ θ (1−θ) 1−θ ≤ 2 for every 0 < θ < 1, and C(1) = 1.
Proof The inequality is an immediate consequence of Corollary 3.1 in combination with the following lemma, which is surely known to specialists; for the sake of completeness we include a proof of it. ( , , μ) be a probability measure. If log | f | ∈ L 1 (μ) and A ∈ with μ(A) = α, then
With A = \ A, this inequality yields To complete the proof, it is sufficient to observe that x x (1 − x) 1−x ≥ 1/2 for every 0 < x < 1.