Shattered Sets and the Hilbert Function

We study complexity measures on subsets of the boolean hypercube and exhibit connections between algebra (the Hilbert function) and combinatorics (VC theory). These connections yield results in both directions. Our main complexity-theoretic result proves that most linear program feasibility problems cannot be computed by polynomial-sized constant-depth circuits. Moreover, our result applies to a stronger regime in which the hyperplanes are fixed and only the directions of the inequalities are given as input to the circuit. We derive this result by proving that a rich class of extremal functions in VC theory cannot be approximated by low-degree polynomials. We also present applications of algebra to combinatorics. We provide a new algebraic proof of the Sandwich Theorem, which is a generalization of the well-known Sauer-Perles-Shelah Lemma. Finally, we prove a structural result about downward-closed sets, related to the Chv\'{a}tal conjecture in extremal combinatorics.

[1]  Emo Welzl,et al.  Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements , 1994, Discret. Comput. Geom..

[2]  T. Sanders,et al.  Analysis of Boolean Functions , 2012, ArXiv.

[3]  Hans-Jürgen Bandelt,et al.  Combinatorics of lopsided sets , 2006, Eur. J. Comb..

[4]  Hunter S. Snevily.  Combinatorics of finite sets , 1991 .

[5]  Béla Bollobás,et al.  Defect Sauer Results , 1995, J. Comb. Theory A.

[6]  Dana Ron,et al.  Testing Monotonicity , 2000, Comb..

[7]  A. Razborov.  Lower bounds on the size of bounded depth circuits over a complete basis with logical addition , 1987 .

[8]  Béla Bollobás,et al.  Sums in the grid , 1996, Discret. Math..

[9]  Andreas W. M. Dress,et al.  Towards a theory of holistic clustering , 1996, Mathematical Hierarchies and Biology.

[10]  P. Frankl,et al.  Linear Algebra Methods in Combinatorics I , 1988 .

[11]  Stasys Jukna,et al.  Extremal Combinatorics - With Applications in Computer Science , 2001, Texts in Theoretical Computer Science. An EATCS Series.

[12]  Shay Moran,et al.  Shattering-Extremal Systems , 2012, ArXiv.

[13]  Henryk Wozniakowski,et al.  Complexity of linear programming , 1982, Oper. Res. Lett..

[14]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.

[15]  R. Stanley.  An Introduction to Hyperplane Arrangements , 2007 .

[16]  Noga Alon,et al.  Sign rank, VC dimension and spectral gaps , 2014, Electron. Colloquium Comput. Complex..

[17]  D. Knuth,et al.  Selected combinatorial research problems. , 1972 .

[18]  Vojtech Rödl,et al.  Geometrical realization of set systems and probabilistic communication complexity , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[19]  Richard Beigel,et al.  The polynomial method in circuit complexity , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[20]  L. Guth,et al.  On the Erdős distinct distances problem in the plane , 2015 .

[21]  Leonid Gurvits.  Linear Algebraic Proofs of VC-Dimension Based Inequalities , 1997, EuroCOLT.

[22]  D. Kleitman.  Families of Non-disjoint subsets* , 1966 .

[23]  James Aspnes,et al.  The expressive power of voting polynomials , 1991, STOC '91.

[24]  I. Anderson.  Combinatorics of Finite Sets , 1987 .

[25]  Anna Bernasconi,et al.  Hilbert Function and Complexity Lower Bounds for Symmetric Boolean Functions , 1999, Inf. Comput..

[26]  Zeev Dvir,et al.  On the size of Kakeya sets in finite fields , 2008, 0803.2336.

[27]  David Newnham.  Shattering news. , 2016, Nursing standard (Royal College of Nursing (Great Britain) : 1987).

[28]  Lajos Rónyai,et al.  Shattering-Extremal Set Systems of VC Dimension at most 2 , 2014, Electron. J. Comb..

[29]  Terence Tao,et al.  Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory , 2013, 1310.6482.

[30]  J. Lawrence.  Lopsided sets and orthant-intersection by convex sets , 1983 .

[31]  Ben Green,et al.  Freiman's Theorem in Finite Fields via Extremal Set Theory , 2009, Comb. Probab. Comput..

[32]  Shay Moran,et al.  Teaching and compressing for low VC-dimension , 2015, Electron. Colloquium Comput. Complex..

[33]  Lajos Rónyai,et al.  S-extremal set systems and Gröbner bases , 2010 .

[34]  Shay Moran,et al.  Labeled Compression Schemes for Extremal Classes , 2015, ALT.

[35]  Roman Smolensky.  Well-known bound for the VC-dimension made easy , 2005, computational complexity.

[36]  R. Smolensky.  On representations by low-degree polynomials , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[37]  Béla Bollobás,et al.  Reverse Kleitman Inequalities , 1989 .

[38]  Shachar Lovett,et al.  Nonclassical polynomials as a barrier to polynomial lower bounds , 2014, Electron. Colloquium Comput. Complex..

[39]  Ryan O'Donnell,et al.  Analysis of Boolean Functions , 2014, ArXiv.

[40]  Noga Alon.  Combinatorial Nullstellensatz , 1999, Combinatorics, Probability and Computing.

[41]  Joshua Zahl,et al.  Improved Bounds for Incidences Between Points and Circles , 2015, Comb. Probab. Comput..

[42]  Shay Moran,et al.  Shattering, Graph Orientations, and Connectivity , 2012, Electron. J. Comb..

[43]  P. Enflo.  On the nonexistence of uniform homeomorphisms betweenLp-spaces , 1970 .

[44]  Zachary Remscrim,et al.  The Hilbert Function, Algebraic Extractors, and Recursive Fourier Sampling , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).