Rank Bounds for Design Matrices and Applications
194 views · Published 1 February 2018 · 24:36 · Indexed 12 November 2026
Channel: Institut Henri Poincaré · 2018 · Science & Technology
By Abdul Basit (Notre Dame) Abstract: A (q, k, t)-design matrix is an m by n matrix whose pattern of zeros/non-zeros satisfies the following design-like condition: Each row has at most q non-zeros, each column has at least k non-zeros and the supports of every two columns intersect in at most t rows. Dvir–Saraf—Wigderson showed a lower bound of n − ntq(q − 1)/k on the rank of such matrices over fields of characteristic zero (or sufficiently large finite characteristic). Rank bounds of design matrices have been used to study various problems in discrete geometry, such as rigidity theory, geometric incidences and Sylvester–Gallai type problems. In this talk, I will give a survey of the method as well as some of its applications.
More from this channel
-
29:47
10 ans du Groupe Calcul : Histoire du Calcul - Introduction
-
52:14
Gauss, Jacobi, Seidel, Richardson, Krylov: the Invention of Iterative Methods
-
55:33
Les "invariants arithmétiques" de H. Poincaré
-
1:08:53
Henri Poincaré, a founding father of the modern theory of PDEs
-
57:13
Sympletic topology from Poincaré to Gromov
-
57:35
Structural Realism, Then and Now
-
46:26
Poincaré inequalities in probability and geometric analysis
-
1:02:05
On the contributions of Henri Poincaré to modern geophysics...