Hypercontractive Inequality for Pseudo-Boolean Functions of Bounded Fourier Width
Discrete Mathematics
2012-12-04 v3 Computational Complexity
Data Structures and Algorithms
Abstract
A function f: {−1,1}n→R is called pseudo-Boolean. It is well-known that each pseudo-Boolean function f can be written as f(x)=∑I∈Ff^(I)χI(x), where F⊆{I: I⊆[n]}, [n]={1,2,...,n}, and χI(x)=∏i∈Ixi and f^(I) are non-zero reals. The degree of f is max{∣I∣: I∈F} and the width of f is the minimum integer ρ such that every i∈[n] appears in at most ρ sets in F. For i∈[n], let xi be a random variable taking values 1 or -1 uniformly and independently from all other variables xj, j=i. Let x=(x1,...,xn). The p-norm of f is ∣∣f∣∣p=(E[∣f(x)∣p])1/p for any p≥1. It is well-known that ∣∣f∣∣q≥∣∣f∣∣p whenever q>p≥1. However, the higher norm can be bounded by the lower norm times a coefficient not directly depending on f: if f is of degree d and q>p>1 then ∣∣f∣∣q≤(p−1q−1)d/2∣∣f∣∣p. This inequality is called the Hypercontractive Inequality. We show that one can replace d by ρ in the Hypercontractive Inequality for each q>p≥2 as follows: ∣∣f∣∣q≤((2r)!ρr−1)1/(2r)∣∣f∣∣p, where r=⌈q/2⌉. For the case q=4 and p=2, which is important in many applications, we prove a stronger inequality: ∣∣f∣∣4≤(2ρ+1)1/4∣∣f∣∣2.
Cite
@article{arxiv.1106.1049,
title = {Hypercontractive Inequality for Pseudo-Boolean Functions of Bounded Fourier Width},
author = {Gregory Gutin and Anders Yeo},
journal= {arXiv preprint arXiv:1106.1049},
year = {2012}
}