Institutional Repository
| characterizations of locally testable linear- and affine-invariant families | |
| Li Angsheng; Pan Yicheng | |
| 2011 | |
| Conference Name | 17th Annual International Computing and Combinatorics Conference, COCOON 2011 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 467-478 |
| Conference Date | August 14, |
| Conference Place | Dallas, TX, United states |
| Publish Place | Germany |
| ISSN | 3029743 |
| ISBN | 9783642226847 |
| Department | (1) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China |
| English Abstract | The linear- or affine-invariance is the property of a function family that is closed under linear- or affine- transformations on the domain, and closed under linear combinations of functions, respectively. Both the linear- and affine-invariant families of functions are generalizations of many symmetric families, for instance, the low degree polynomials. Kaufman and Sudan [21] started the study of algebraic properties test by introducing the notions of “constraint” and “ characterization” to characterize the locally testable affine- and linear-invariant families of functions over finite fields of constant size. In this article, it is shown that, for any finite field of size q and characteristic p , and its arbitrary extension field of size Q , if an affine-invariant family has a k -local constraint, then it is k ′-locally testable for ; and that if a linear-invariant family has a k -local characterization, then it is k ′-locally testable for . Consequently, for any prime field of size q , any positive integer k , we have that for any affine-invariant family over field , the four notions of “the constraint”, “the characterization”, “the formal characterization” and “the local testability” are equivalent modulo a poly( k , q ) of the corresponding localities; and that for any linear-invariant family, the notions of “the characterization”, “the formal characterization” and “the local testability” are equivalent modulo a poly( k , q ) of the corresponding localities. The results significantly improve, and are in contrast to the characterizations in [21], which have locality exponential in Q , even if the field is prime. In the research above, a missing result is a characterization of linear-invariant function families by the more natural notion of constraint. For this, we show that a single strong local constraint is sufficient to characterize the local testability of a linear-invariant Boolean function family, and that for any finite field of size q greater than 2, there exists a linear-invariant function family over such that it has a strong 2-local constraint, but is not -locally testable. The proof for this result provides an appealing approach towards more negative results in the theme of characterization of locally testable algebraic properties, which is rare, and of course, significant. |
| Keyword | Algebra Boolean Functions Characterization Codes (Symbols) Combinatorial Mathematics Finite Element Method |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/14351 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation GB/T 7714 | Li Angsheng,Pan Yicheng. characterizations of locally testable linear- and affine-invariant families[C]. Germany,2011:467-478. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| characterizations of（254KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment