Perturbed Identity Matrices Have High Rank: Proof and Applications

We describe a lower bound for the rank of any real matrix in which all diagonal entries are significantly larger in absolute value than all other entries, and discuss several applications of this result to the study of problems in Geometry, Coding Theory, Extremal Finite Set Theory and Probability. This is partly a survey, containing a unified approach for proving various known results, but it contains several new results as well.

[1]  András Sárközy,et al.  On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol , 1997 .

[2]  Stasys Jukna,et al.  Extremal Combinatorics , 2001, Texts in Theoretical Computer Science. An EATCS Series.

[3]  Yoshinori Takei,et al.  On permutations with limited independence , 2000, SODA '00.

[4]  Jirí Matousek,et al.  On restricted min‐wise independence of permutations , 2003, Random Struct. Algorithms.

[5]  W. B. Johnson,et al.  Extensions of Lipschitz mappings into Hilbert space , 1984 .

[6]  Noga Alon,et al.  Problems and results in extremal combinatorics--I , 2003, Discret. Math..

[7]  Pavel Pudlák,et al.  Some structural properties of low-rank matrices related to computational complexity , 2000, Theor. Comput. Sci..

[8]  Kim-Chuan Toh,et al.  The Chebyshev Polynomials of a Matrix , 1999, SIAM J. Matrix Anal. Appl..

[9]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[10]  S. A. Norin.  A Polynomial Lower Bound on the Size of a k-Min-Wise Independent Set of Permutations , 2003 .

[11]  András Sárközy,et al.  On finite pseudorandom binary sequences VII: The measures of pseudorandomness , 2002 .

[12]  T. J. Rivlin.  The Chebyshev polynomials , 1974 .

[13]  Noga Alon,et al.  Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.

[14]  Noga Alon,et al.  Testing k-wise and almost k-wise independence , 2007, STOC '07.

[15]  Noga Alon,et al.  Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[16]  András Sárközy,et al.  On Finite Pseudorandom Binary Sequences: II. The Champernowne, Rudin–Shapiro, and Thue–Morse Sequences, A Further Construction , 1998 .

[17]  Noga Alon,et al.  On (ε,k)-min-wise independent permutations , 2007 .

[18]  Alan M. Frieze,et al.  Min-wise independent permutations (extended abstract) , 1998, STOC '98.

[19]  Jr. Hall.  Combinatorial theory (2nd ed.) , 1998 .

[20]  Christian Mauduit,et al.  On Finite Pseudorandom Binary Sequences: II. The Champernowne, Rudin–Shapiro, and Thue–Morse Sequences, A Further Construction , 1998 .

[21]  Yoshiharu Kohayakawa,et al.  Measures of Pseudorandomness for Finite Sequences: Minimal Values , 2006, Combinatorics, Probability and Computing.

[22]  Jiri Matousek,et al.  Lectures on discrete geometry , 2002, Graduate texts in mathematics.

[23]  András Sárközy,et al.  A finite pseudorandom binary sequence , 2001 .

[24]  Alan M. Frieze,et al.  Min-Wise Independent Permutations , 2000, J. Comput. Syst. Sci..