# Matrix rigidity and the Croot-Lev-Pach lemma

@article{Dvir2017MatrixRA,
title={Matrix rigidity and the Croot-Lev-Pach lemma},
author={Zeev Dvir and Benjamin Edelman},
journal={ArXiv},
year={2017},
volume={abs/1708.01646}
}
• Published 2017
• Computer Science, Mathematics
• ArXiv
• Matrix rigidity is a notion put forth by Valiant as a means for proving arithmetic circuit lower bounds. A matrix is rigid if it is far, in Hamming distance, from any low rank matrix. Despite decades of efforts, no explicit matrix rigid enough to carry out Valiant's plan has been found. Recently, Alman and Williams showed, contrary to common belief, that the $2^n \times 2^n$ Hadamard matrix could not be used for Valiant's program as it is not sufficiently rigid. In this note we observe a… CONTINUE READING

#### Citations

##### Publications citing this paper.
SHOWING 1-10 OF 12 CITATIONS

## Fourier and Circulant Matrices are Not Rigid

• Computer Science, Mathematics
• Computational Complexity Conference
• 2019

## Lower Bounds for Matrix Factorization

• Computer Science, Mathematics
• Electronic Colloquium on Computational Complexity
• 2019

## Equivalence of Systematic Linear Data Structures and Matrix Rigidity

• Computer Science, Mathematics
• Electronic Colloquium on Computational Complexity
• 2019

## Which groups are amenable to proving exponent two for matrix multiplication?

• Computer Science, Mathematics
• ArXiv
• 2017

## Rigid Matrices From Rectangular PCPs

• Mathematics, Computer Science
• Electronic Colloquium on Computational Complexity
• 2020

## The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications

• Mathematics, Computer Science
• ArXiv
• 2020

• 2019

• 2018

## New applications of the polynomial method: The cap set conjecture and beyond

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

## Matrix rigidity of random Toeplitz matrices

• Mathematics, Computer Science
• computational complexity
• 2016
VIEW 1 EXCERPT
HIGHLY INFLUENTIAL

## Probabilistic rank and matrix rigidity

• Computer Science, Mathematics
• STOC
• 2017

## Graph-Theoretic Arguments in Low-Level Complexity

VIEW 2 EXCERPTS

## On large subsets of $F_q^n$ with no three-term arithmetic progression

• Mathematics
• 2016

## On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions

• Computer Science, Mathematics
• Electronic Colloquium on Computational Complexity
• 2013

## A Remark on Matrix Rigidity

• Mathematics, Computer Science
• Inf. Process. Lett.
• 1997

## Progression-free sets in Z_4^n are exponentially small

• Mathematics
• 2017

## Complexity Lower Bounds using Linear Algebra

VIEW 2 EXCERPTS

## A Course on Large Deviations With an Introduction to Gibbs Measures

• Mathematics
• 2015