TY - JOUR

T1 - Fourier and circulant matrices are not rigid

AU - Dvir, Zeev

AU - Liu, Allen

N1 - Funding Information:
A preliminary version of this paper appeared in the Proceedings of the 34th IEEE Conference on Computational Complexity, 2019. ∗Research supported by NSF CAREER award DMS-1451191 and NSF grant CCF-1523816.
Publisher Copyright:
© 2020 Zeev Dvir and Allen Liu.

PY - 2020

Y1 - 2020

N2 - The concept of matrix rigidity was first introduced by Valiant in 1977. Roughly speaking, a matrix is rigid if its rank cannot be reduced significantly by changing a small number of entries. There has been considerable interest in the explicit construction of rigid matrices as Valiant showed in his MFCS’77 paper that explicit families of rigid matrices can be used to prove lower bounds for arithmetic circuits. In a surprising recent result, Alman and Williams (FOCS’19) showed that the 2nx2n Walsh–Hadamard matrix, which was conjectured to be rigid, is actually not very rigid. This line of work was extended by Dvir and Edelman (Theory of Computing, 2019) to a family of matrices related to the Walsh–Hadamard matrix, but over finite fields. In the present paper we take another step in this direction and show that for any abelian group G and function f: G!C, the G-circulant matrix, given by Mxy = f (x-y) for x;y 2 G, is not rigid over C. Our results also hold if we replace C with a finite field Fq and require that gcd(q; jGj) = 1. En route to our main result, we show that circulant and Toeplitz matrices (over finite fields or C) and Discrete Fourier Transform (DFT) matrices (over C) are not sufficiently rigid to carry out Valiant’s approach to proving circuit lower bounds. This complements a recent result of Goldreich and Tal (Comp. Complexity, 2018) who showed that Toeplitz matrices are nontrivially rigid (but not enough for Valiant’s method). Our work differs from previous non-rigidity results in that those papers considered matrices whose underlying group of symmetries was of the form Zn p with p fixed and n tending to infinity, while in the families of matrices we study, the underlying group of symmetries can be any abelian group and, in particular, the cyclic group ZN, which has very different structure. Our results also suggest natural new candidates for rigidity in the form of matrices whose symmetry groups are highly non-abelian.

AB - The concept of matrix rigidity was first introduced by Valiant in 1977. Roughly speaking, a matrix is rigid if its rank cannot be reduced significantly by changing a small number of entries. There has been considerable interest in the explicit construction of rigid matrices as Valiant showed in his MFCS’77 paper that explicit families of rigid matrices can be used to prove lower bounds for arithmetic circuits. In a surprising recent result, Alman and Williams (FOCS’19) showed that the 2nx2n Walsh–Hadamard matrix, which was conjectured to be rigid, is actually not very rigid. This line of work was extended by Dvir and Edelman (Theory of Computing, 2019) to a family of matrices related to the Walsh–Hadamard matrix, but over finite fields. In the present paper we take another step in this direction and show that for any abelian group G and function f: G!C, the G-circulant matrix, given by Mxy = f (x-y) for x;y 2 G, is not rigid over C. Our results also hold if we replace C with a finite field Fq and require that gcd(q; jGj) = 1. En route to our main result, we show that circulant and Toeplitz matrices (over finite fields or C) and Discrete Fourier Transform (DFT) matrices (over C) are not sufficiently rigid to carry out Valiant’s approach to proving circuit lower bounds. This complements a recent result of Goldreich and Tal (Comp. Complexity, 2018) who showed that Toeplitz matrices are nontrivially rigid (but not enough for Valiant’s method). Our work differs from previous non-rigidity results in that those papers considered matrices whose underlying group of symmetries was of the form Zn p with p fixed and n tending to infinity, while in the families of matrices we study, the underlying group of symmetries can be any abelian group and, in particular, the cyclic group ZN, which has very different structure. Our results also suggest natural new candidates for rigidity in the form of matrices whose symmetry groups are highly non-abelian.

KW - Circulant matrix

KW - Matrix rigidity

UR - http://www.scopus.com/inward/record.url?scp=85112416875&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85112416875&partnerID=8YFLogxK

U2 - 10.4086/TOC.2020.V016A020

DO - 10.4086/TOC.2020.V016A020

M3 - Article

AN - SCOPUS:85112416875

VL - 16

JO - Theory of Computing

JF - Theory of Computing

SN - 1557-2862

M1 - 20

ER -