Fourier熵和Min熵的改进界
Improved bounds on Fourier entropy and Min-entropy
摘要:
给定布尔函数$f:\{-1,1\}^n\to \{-1,1\}$,傅立叶分布将概率$\widehat{f}(S)^2$分配给$S\subseteq [n]$。Friedgut和Kalai的傅立叶熵影响(FEI)猜想提出了一个问题:是否存在一个普适常数C> 0,使得$H(\hat{f}^2)\leq C Inf(f)$,其中$H(\hat{f}^2)$是$f$的傅立叶分布的香农熵,$Inf(f)$是$f$的总影响。1)我们考虑较弱的傅立叶最小熵影响(FMEI)猜想。这会询问是否为$H_{\infty}(\hat{f}^2)\leq C Inf(f)$,其中$H_{\infty}(\hat{f}^2)$是傅立叶分布的最小熵。我们展示了$H_{\infty}(\hat{f}^2)\leq 2C_{\min}^\oplus(f)$,其中$C_{\min}^\oplus(f)$是$f$的最小奇偶校验证书复杂度。我们还表明,对于每个$ε\geq 0$,我们都有$H_{\infty}(\hat{f}^2)\leq 2\log (\|\hat{f}\|_{1,ε}/(1-ε))$,其中$\|\hat{f}\|_{1,ε}$是$f$的近似谱范数。作为一个推论,我们验证了FMEI猜想的类读$k$ $DNF$ s(常数$k$)。2)我们表明,$H(\hat{f}^2)\leq 2 aUC^\oplus(f)$,其中$aUC^\oplus(f)$是平均明确的奇偶校验证书的复杂性$f$。这改进了Chakraborty等人。FEI猜想的一个重要结果是长期存在的曼苏尔猜想。我们表明,一个较弱的版本FEI已经暗示曼苏尔的猜想:是$H(\hat{f}^2)\leq C \min\{C^0(f),C^1(f)\}$?,其中$C^0(f), C^1(f)$分别是$f$的0和1证书复杂度。3)我们研究什么FEI意味着1/3近似布尔函数的多项式的结构。我们提出了一个猜想(这是隐含的FEI):没有“平坦”度$d$多项式的稀疏$2^{ω(d)}$可以1/3近似布尔函数。我们证明了这一猜想无条件的一类特定的多项式。
英文摘要:
Given a Boolean function $f:\{-1,1\}^n\to \{-1,1\}$, the Fourier distribution assigns probability $\widehat{f}(S)^2$ to $S\subseteq [n]$. The Fourier Entropy-Influence (FEI) conjecture of Friedgut and Kalai asks if there exist a universal constant C>0 such that $H(\hat{f}^2)\leq C Inf(f)$, where $H(\hat{f}^2)$ is the Shannon entropy of the Fourier distribution of $f$ and $Inf(f)$ is the total influence of $f$. 1) We consider the weaker Fourier Min-entropy-Influence (FMEI) conjecture. This asks if $H_{\infty}(\hat{f}^2)\leq C Inf(f)$, where $H_{\infty}(\hat{f}^2)$ is the min-entropy of the Fourier distribution. We show $H_{\infty}(\hat{f}^2)\leq 2C_{\min}^\oplus(f)$, where $C_{\min}^\oplus(f)$ is the minimum parity certificate complexity of $f$. We also show that for every $ε\geq 0$, we have $H_{\infty}(\hat{f}^2)\leq 2\log (\|\hat{f}\|_{1,ε}/(1-ε))$, where $\|\hat{f}\|_{1,ε}$ is the approximate spectral norm of $f$. As a corollary, we verify the FMEI conjecture for the class of read-$k$ $DNF$s (for constant $k$). 2) We show that $H(\hat{f}^2)\leq 2 aUC^\oplus(f)$, where $aUC^\oplus(f)$ is the average unambiguous parity certificate complexity of $f$. This improves upon Chakraborty et al. An important consequence of the FEI conjecture is the long-standing Mansour's conjecture. We show that a weaker version of FEI already implies Mansour's conjecture: is $H(\hat{f}^2)\leq C \min\{C^0(f),C^1(f)\}$?, where $C^0(f), C^1(f)$ are the 0- and 1-certificate complexities of $f$, respectively. 3) We study what FEI implies about the structure of polynomials that 1/3-approximate a Boolean function. We pose a conjecture (which is implied by FEI): no "flat" degree-$d$ polynomial of sparsity $2^{ω(d)}$ can 1/3-approximate a Boolean function. We prove this conjecture unconditionally for a particular class of polynomials.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。