Bounded Matrix Rigidity and John's Theorem

Using John’s Theorem, we prove a lower bound on the bounded rigidity of a sign matrix, defined as the Hamming distance between this matrix and the set of low-rank, real-valued matrices with entries bounded in absolute value. For Hadamard matrices, our asymptotic leading constant is tighter than known results by a factor of two whenever the approximating matrix has sufficiently small entries.

[1]  Silvio Levy,et al.  Flavors of Geometry , 1997 .

[2]  Leslie G. Valiant,et al.  Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.

[3]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[4]  A. Razborov,et al.  Improved lower bounds on the rigidity of Hadamard matrices , 1998 .

[5]  Jürgen Forster.  A linear lower bound on the unbounded error probabilistic communication complexity , 2002, J. Comput. Syst. Sci..

[6]  K. Ball.  An Elementary Introduction to Modern Convex Geometry , 1997 .

[7]  Ronald de Wolf.  Lower Bounds on Matrix Rigidity Via a Quantum Argument , 2006, ICALP.

[8]  Daniel A. Spielman,et al.  A Remark on Matrix Rigidity , 1997, Inf. Process. Lett..

[9]  Stasys Jukna,et al.  Boolean Function Complexity Advances and Frontiers , 2012, Bull. EATCS.

[10]  F. John.  Extremum Problems with Inequalities as Subsidiary Conditions , 2014 .

[11]  Satyanarayana V. Lokam.  Spectral Methods for Matrix Rigidity with Applications to Size-Depth Trade-offs and Communication Complexity , 2001, J. Comput. Syst. Sci..

[12]  Joel Friedman,et al.  A note on matrix rigidity , 1993, Comb..

[13]  Pavel Pudlák,et al.  A note on the use of determinant for proving lower bounds on the size of linear circuits , 2000, Inf. Process. Lett..

[14]  A. Hoffman,et al.  The variation of the spectrum of a normal matrix , 1953 .

[15]  B. Codenotti.  Matrix Rigidity , 1999 .

[16]  K. Ball.  An elementary introduction to modern convex geometry, in flavors of geometry , 1997 .

[17]  Jan Kratochvíl,et al.  Mathematical Foundations of Computer Science 2004 , 2004, Lecture Notes in Computer Science.

[18]  Matthias Krause,et al.  Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[19]  Thomas Rothvoß.  A direct proof for Lovett's bound on the communication complexity of low rank matrices , 2014, ArXiv.

[20]  Satyanarayana V. Lokam.  Complexity Lower Bounds using Linear Algebra , 2009, Found. Trends Theor. Comput. Sci..