Perturbed identity matrices have high rank: Proof and applications

Combinatorics Probability and Computing

Volumn 18, Issue 1-2, 2009, Pages 3-15

  Alon, Noga ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ABSOLUTE VALUES; CODING THEORY; EXTREMAL; IDENTITY MATRICES; LOWER BOUNDS; NEW RESULTS; REAL MATRICES; UNIFIED APPROACH;

COMPUTER PROGRAMMING; CONTROL THEORY; INFORMATION THEORY;

SET THEORY;

EID: 67649235151     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548307008917     Document Type: Article

References (20)

1. Alon, N. (2003) Problems and results in extremal combinatorics I. Discrete Math. 273 31-53.
2. Alon, N., Andoni, A., Kaufman, T., Matulef, K., Rubinfeld, R. and Xie, N. (2007) Testing κ-wise and almost κ-wise independence. In Proc. 39th ACM Symposium on Theory of Computing, pp. 496-505.
3. Alon, N., Goldreich, O., Hastad, J. and Peralta, R. (1990) Simple constructions of almost κ-wise independent random variables. In Proc. 31st IEEE Symposium on Foundations of Computer Science, pp. 544-553.
4. Also Random Struct. Alg. 3 (1992) 289-304.
5. Alon, N., Kohayakawa, Y., Mauduit, C., Moreira, C. G. and Rödl, V. (2006) Measures of pseudo-randomness for finite sequences: Minimal values. Combin. Probab. Comput. 15 1-29.
6. Alon, N., Itoh, T. and Nagatani, T. (2007) On (ε,κ)-min-wise independent permutations. Random Struct. Alg. 31 384-389.
7. Broder, A., Charikar, M., Frieze, A. and Mitzenmacher, M. (2000) Min-wise independent permutations. J. Comput. System Sci. 60 630-659.
8. A preliminary version appeared in Proc. 30th Annual ACM Symposium on Theory of Computing (1998), pp. 327-336.
9. Cassaigne, J., Mauduit, C. and Sárközy, A. (2002) On finite pseudorandom binary sequences VII: The measures of pseudorandomness. Acta Arith. 103 97-118.
10. Codenotti, B., Pudlák, P. and Resta, G. (2000) Some structural properties of low-rank matrices related to computational complexity. Theoret. Comput. Sci. 235 89-107.
11. Hall, M. (1986) Combinatorial Theory, 2nd edn, Wiley.
12. Itoh, T., Takei, Y. and Tarui, J. (2000) On permutations with limited independence. In Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 137-146.
13. Johnson, W. B. and Lindenstrauss, J. (1984) Extensions of Lipschitz mappings into a Hilbert space. In Vol. 26 of Contemporary Mathematics, AMS, Providence, RI, pp. 189-206.
14. Jukna, S. (2001) Extremal Combinatorics, Springer, Berlin.
15. MacWilliams, R J. and Sloane, N. J. A. (1977) The Theory of Error-Correcting Codes, North-Holland, Amsterdam.
16. Mauduit, C. and Sárközy, A. (1997) On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol. Acta Arith. 82 365-377.
17. Matoušek, J. (2002) Lectures on Discrete Geometry, Springer.
18. Matoušek, J. and Stojaković, M. (2003) On restricted min-wise independence of permutations. Random Struct. Alg. 23 397-408.
19. Norin, S. (2001) A polynomial lower bound for the size of any κ-min-wise independent set of permutation. Zapiski Nauchnyh Seminarov (POMI) 277 104-116 (in Russian). Available at http://www.pdmi.ras.ru/znsl/
20. Rivin, T. J. (1990) The Chebyshev Polynomials, Wiley, New York.