Using Elimination Theory to construct Rigid Matrices
Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal, Sarma M. N

TL;DR
This paper constructs an infinite family of complex matrices with maximal rigidity using elimination theory, addressing a long-standing open problem in matrix rigidity and complexity theory.
Contribution
It introduces the first family of concrete matrices with maximal rigidity and a succinct algebraic description, constructed via elimination theory.
Findings
Matrices have maximal rigidity of (n-r)^2
Entries are distinct primitive roots of unity with large orders
Dimension of the variety of matrices with bounded rigidity is precisely characterized
Abstract
The rigidity of a matrix A for target rank r is the minimum number of entries of A that must be changed to ensure that the rank of the altered matrix is at most r. Since its introduction by Valiant (1977), rigidity and similar rank-robustness functions of matrices have found numerous applications in circuit complexity, communication complexity, and learning complexity. Almost all nxn matrices over an infinite field have a rigidity of (n-r)^2. It is a long-standing open question to construct infinite families of explicit matrices even with superlinear rigidity when r = Omega(n). In this paper, we construct an infinite family of complex matrices with the largest possible, i.e., (n-r)^2, rigidity. The entries of an n x n matrix in this family are distinct primitive roots of unity of orders roughly exp(n^2 log n). To the best of our knowledge, this is the first family of concrete (but not…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms
