Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs

We introduce a simple logical inference structure we call a “spanoid" (generalizing the notion of a matroid), which captures well-studied problems in several areas. These include combinatorial geom...

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

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

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

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

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

[6]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[7]  Zeev Dvir,et al.  Tight Lower Bounds for 2-query LCCs over Finite Fields , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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