Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Noga Alon (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: