arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1201.0330cs.CCmath.CO
收藏

测试低复杂度仿射不变性质

Testing Low Complexity Affine-Invariant Properties

Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett

摘要:

关于域的线性或仿射变换的不变性可以说是自然代数性质所表现出的最常见的对称性。在这项工作中,我们表明,任何低复杂度的仿射不变性质的多元函数在有限域是可测试的一个常数数量的查询。例如,这立即反驳了F_p上次数为d < p的里德-穆勒码是可测试的,其论点除了通过与仿射映射的合成来保持低次数之外,没有使用关于多项式的详细代数信息。仿射不变性质P的复杂度是指格林和陶定义的最大复杂度(Ann.Math.2008),用于表征P的线性形式的集合。我们的主要结果的更精确的陈述是,对于任何固定素数p >=2和固定整数R >= 2,函数f的任何仿射不变性质P:F_p^n -> [R]是可测试的,假设该属性的复杂性小于p。我们的证明涉及在代数环境中开发类似的图论技术,使用高阶傅立叶分析的工具。

英文摘要:

Invariance with respect to linear or affine transformations of the domain is arguably the most common symmetry exhibited by natural algebraic properties. In this work, we show that any low complexity affine-invariant property of multivariate functions over finite fields is testable with a constant number of queries. This immediately reproves, for instance, that the Reed-Muller code over F_p of degree d < p is testable, with an argument that uses no detailed algebraic information about polynomials except that low degree is preserved by composition with affine maps. The complexity of an affine-invariant property P refers to the maximum complexity, as defined by Green and Tao (Ann. Math. 2008), of the sets of linear forms used to characterize P. A more precise statement of our main result is that for any fixed prime p >=2 and fixed integer R >= 2, any affine-invariant property P of functions f: F_p^n -> [R] is testable, assuming the complexity of the property is less than p. Our proof involves developing analogs of graph-theoretic techniques in an algebraic setting, using tools from higher-order Fourier analysis.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑