Spanoids - an abstraction of spanning structures, and a barrier for LCCs

We introduce a simple logical inference structure we call a $\textsf{spanoid}$ (generalizing the notion of a matroid), which captures well-studied problems in several areas. These include combinatorial geometry, algebra (arrangements of hypersurfaces and ideals), statistical physics (bootstrap percolation) and coding theory. We initiate a thorough investigation of spanoids, from computational and structural viewpoints, focusing on parameters relevant to the applications areas above and, in particular, to questions regarding Locally Correctable Codes (LCCs). One central parameter we study is the $\textsf{rank}$ of a spanoid, extending the rank of a matroid and related to the dimension of codes. This leads to one main application of our work, establishing the first known barrier to improving the nearly 20-year old bound of Katz-Trevisan (KT) on the dimension of LCCs. On the one hand, we prove that the KT bound (and its more recent refinements) holds for the much more general setting of spanoid rank. On the other hand we show that there exist (random) spanoids whose rank matches these bounds. Thus, to significantly improve the known bounds one must step out of the spanoid framework. Another parameter we explore is the $\textsf{functional rank}$ of a spanoid, which captures the possibility of turning a given spanoid into an actual code. The question of the relationship between rank and functional rank is one of the main questions we raise as it may reveal new avenues for constructing new LCCs (perhaps even matching the KT bound). As a first step, we develop an entropy relaxation of functional rank to create a small constant gap and amplify it by tensoring to construct a spanoid whose functional rank is smaller than rank by a polynomial factor. This is evidence that the entropy method we develop can prove polynomially better bounds than KT-type methods on the dimension of LCCs.

[1]  L. M. Kelly,et al.  A resolution of the sylvester-gallai problem of J.-P. serre , 1986, Discret. Comput. Geom..

[2]  Klim Efremenko,et al.  3-Query Locally Decodable Codes of Subexponential Length , 2008 .

[3]  Emanuel Knill Graph generated union-closed families of sets , 1994 .

[4]  Raymond W. Yeung,et al.  Information Theory and Network Coding , 2008 .

[5]  Avi Wigderson,et al.  Fractional Sylvester–Gallai theorems , 2012, Proceedings of the National Academy of Sciences.

[6]  Michael Alekhnovich,et al.  Lower bounds for polynomial calculus: non-binomial case , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[7]  Arnab Bhattacharyya,et al.  Lower Bounds for 2-Query LCCs over Large Alphabet , 2017, APPROX-RANDOM.

[8]  P. Erdös,et al.  Families of finite sets in which no set is covered by the union ofr others , 1985 .

[9]  Or Meir,et al.  High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity , 2016, STOC.

[10]  Zeev Dvir,et al.  Incidence Theorems and Their Applications , 2012, Found. Trends Theor. Comput. Sci..

[11]  Michael T. Goodrich,et al.  Almost optimal set covers in finite VC-dimension , 1995, Discret. Comput. Geom..

[12]  Sergey Yekhanin,et al.  Towards 3-query locally decodable codes of subexponential length , 2008, JACM.

[13]  Eli Ben-Sasson,et al.  Short proofs are narrow—resolution made simple , 2001, JACM.

[14]  Jonathan Katz,et al.  On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.

[15]  Zhen Zhang,et al.  On Characterization of Entropy Function via Information Inequalities , 1998, IEEE Trans. Inf. Theory.

[16]  Amir Shpilka Sylvester-Gallai type theorems for quadratic polynomials , 2019, STOC.

[17]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[18]  WigdersonAvi,et al.  Short proofs are narrowresolution made simple , 2001 .

[19]  Piotr Wójcik,et al.  Union-closed families of sets , 1999, Discret. Math..

[20]  Avi Wigderson,et al.  Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes , 2010, STOC '11.

[21]  David P. Woodruff New Lower Bounds for General Locally Decodable Codes , 2007, Electron. Colloquium Comput. Complex..

[22]  Ronald de Wolf,et al.  Exponential lower bound for 2-query locally decodable codes via a quantum argument , 2002, STOC '03.

[23]  Avi Wigderson,et al.  Breaking the quadratic barrier for 3-LCC's over the reals , 2013, STOC.

[24]  Henning Bruhn,et al.  The Journey of the Union-Closed Sets Conjecture , 2013, Graphs Comb..

[25]  Benny Sudakov,et al.  Maximum union-free subfamilies , 2010, ArXiv.

[26]  Zoltán Füredi On r-Cover-free Families , 1996, J. Comb. Theory, Ser. A.

[27]  Avi Wigderson,et al.  Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs , 2020, SIAM J. Comput..

[28]  Irit Dinur,et al.  Dense Locally Testable Codes Cannot Have Constant Rate and Distance , 2010, APPROX-RANDOM.

[29]  Dror Rawitz,et al.  Hitting sets when the VC-dimension is small , 2005, Inf. Process. Lett..

[30]  Thomas M. Cover,et al.  Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) , 2006 .

[31]  Sergey Yekhanin Locally Decodable Codes , 2012, Found. Trends Theor. Comput. Sci..

[32]  Alex Samorodnitsky,et al.  On Coset Leader Graphs of Structured Linear Codes , 2018, Electron. Colloquium Comput. Complex..

[33]  Shubhangi Saraf,et al.  Locally Decodable Codes , 2016, Encyclopedia of Algorithms.

[34]  Michael Alekhnovich,et al.  Pseudorandom Generators in Propositional Proof Complexity , 2004, SIAM J. Comput..

[35]  Hamed Hatami,et al.  Polynomial method and graph bootstrap percolation , 2017 .

[36]  Frantisek Matús,et al.  Infinitely Many Information Inequalities , 2007, 2007 IEEE International Symposium on Information Theory.