$\mathbb{F}_p^n$在高误码率下仿射不变性质的相关检验
Correlation Testing for Affine Invariant Properties on $\mathbb{F}_p^n$ in the High Error Regime
摘要:
最近,从理论计算机科学的角度对Gowers一致性规范产生了很大的兴趣。这主要是因为这些范数提供了一种方法,用于测试函数$f:\mathbb{F}_p^n \rightarrow \mathbb{F}_p$与次数至多为$d \le p$的多项式的最大相关性是否不可忽略,同时仅对函数进行恒定数量的查询。这是{ \em相关性测试}的实例。在这个框架中,一个固定的测试被应用到一个功能,和测试的接受概率是依赖于相关的功能从属性。这是{ \em邻近不经意测试}的模拟,这是Goldreich和Ron在高错误状态下创造的概念。在这项工作中,我们研究的一般性质是仿射不变的,这是相关性测试使用一个常数的查询。我们表明,任何这样的属性(只要字段大小不是太小),实际上可以测试的Gowers均匀性测试,因此具有相关性的属性相当于具有相关性的程度$d$多项式的一些固定的$d$。我们强调,我们的结果也适用于仿射不变的非线性性质。这完全分类的仿射不变的相关性测试的性质。证明是基于高阶傅立叶分析。另一个成分是一个非平凡的扩展的图论定理的埃尔德什,Lovász和斯宾塞的背景下添加剂数论。
英文摘要:
Recently there has been much interest in Gowers uniformity norms from the perspective of theoretical computer science. This is mainly due to the fact that these norms provide a method for testing whether the maximum correlation of a function $f:\mathbb{F}_p^n \rightarrow \mathbb{F}_p$ with polynomials of degree at most $d \le p$ is non-negligible, while making only a constant number of queries to the function. This is an instance of {\em correlation testing}. In this framework, a fixed test is applied to a function, and the acceptance probability of the test is dependent on the correlation of the function from the property. This is an analog of {\em proximity oblivious testing}, a notion coined by Goldreich and Ron, in the high error regime. In this work, we study general properties which are affine invariant and which are correlation testable using a constant number of queries. We show that any such property (as long as the field size is not too small) can in fact be tested by Gowers uniformity tests, and hence having correlation with the property is equivalent to having correlation with degree $d$ polynomials for some fixed $d$. We stress that our result holds also for non-linear properties which are affine invariant. This completely classifies affine invariant properties which are correlation testable. The proof is based on higher-order Fourier analysis. Another ingredient is a nontrivial extension of a graph theoretical theorem of Erdös, Lovász and Spencer to the context of additive number theory.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。