Skip to main content Accessibility help
×
Home
Hostname: page-component-747cfc64b6-cssqh Total loading time: 0.201 Render date: 2021-06-15T06:57:29.583Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": true, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true }

Perturbed Identity Matrices Have High Rank: Proof and Applications

Published online by Cambridge University Press:  01 March 2009

NOGA ALON
Affiliation:
Schools of Mathematics and Computer Science, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, Israel (e-mail: nogaa@tau.ac.il)
Corresponding
E-mail address:

Abstract

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.

Type
Paper
Copyright
Copyright © Cambridge University Press 2008

Access options

Get access to the full version of this content by using one of the access options below.

References

[1]Alon, N. (2003) Problems and results in extremal combinatorics I. Discrete Math. 273 3153.CrossRefGoogle Scholar
[2]Alon, N., Andoni, A., Kaufman, T., Matulef, K., Rubinfeld, R. and Xie, N. (2007) Testing k-wise and almost k-wise independence. In Proc. 39th ACM Symposium on Theory of Computing, pp. 496–505.Google Scholar
[3]Alon, N., Goldreich, O., Hastad, J. and Peralta, R. (1990) Simple constructions of almost k-wise independent random variables. In Proc. 31st IEEE Symposium on Foundations of Computer Science, pp. 544553. Also Random Struct. Alg. 3 (1992) 289–304.Google Scholar
[4]Alon, N., Kohayakawa, Y., Mauduit, C., Moreira, C. G. and Rödl, V. (2006) Measures of pseudorandomness for finite sequences: Minimal values. Combin. Probab. Comput. 15 129.CrossRefGoogle Scholar
[5]Alon, N., Itoh, T. and Nagatani, T. (2007) On ϵ, k)-min-wise independent permutations. Random Struct. Alg. 31 384389.CrossRefGoogle Scholar
[6]Broder, A., Charikar, M., Frieze, A. and Mitzenmacher, M. (2000) Min-wise independent permutations. J. Comput. System Sci. 60 630–659. A preliminary version appeared in Proc. 30th Annual ACM Symposium on Theory of Computing (1998), pp. 327336.CrossRefGoogle Scholar
[7]Cassaigne, J., Mauduit, C. and Sárközy, A. (2002) On finite pseudorandom binary sequences VII: The measures of pseudorandomness. Acta Arith. 103 97118.CrossRefGoogle Scholar
[8]Codenotti, B., Pudlák, P. and Resta, G. (2000) Some structural properties of low-rank matrices related to computational complexity. Theoret. Comput. Sci. 235 89107.CrossRefGoogle Scholar
[9]Hall, M. (1986) Combinatorial Theory, 2nd edn, Wiley.Google Scholar
[10]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.Google Scholar
[11]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. 189206.Google Scholar
[12]Jukna, S. (2001) Extremal Combinatorics, Springer, Berlin.CrossRefGoogle Scholar
[13]MacWilliams, F. J. and Sloane, N. J. A. (1977) The Theory of Error-Correcting Codes, North-Holland, Amsterdam.Google Scholar
[14]Mauduit, C. and Sárközy, A. (1997) On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol. Acta Arith. 82 365377.Google Scholar
[15]Matoušek, J. (2002) Lectures on Discrete Geometry, Springer.CrossRefGoogle Scholar
[16]Matoušek, J. and Stojaković, M. (2003) On restricted min-wise independence of permutations. Random Struct. Alg. 23 397408.CrossRefGoogle Scholar
[17]Norin, S. (2001) A polynomial lower bound for the size of any k-min-wise independent set of permutation. Zapiski Nauchnyh Seminarov (POMI) 277 104–116 (in Russian). Available at http://www.pdmi.ras.ru/znsl/Google Scholar
[18]Rivin, T. J. (1990) The Chebyshev Polynomials, Wiley, New York.Google Scholar
34
Cited by

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Perturbed Identity Matrices Have High Rank: Proof and Applications
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Perturbed Identity Matrices Have High Rank: Proof and Applications
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Perturbed Identity Matrices Have High Rank: Proof and Applications
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *