Fourier and circulant matrices are not rigid
type: Item
instance of: scholarly article
zbMATH Open document ID: 1477.68117
author: Zeev Dvir
author: Allen P. Liu
published in: Theory of Computing
publication date: 2021-04-01T00:00:00Z
full work available at URL: https://arxiv.org/abs/1902.07334
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 15B99
Mathematics Subject Classification ID: 68Q06
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 7330816
zbMATH Keywords: matrix rigidity
zbMATH Keywords: circulant matrix
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W3118907271
cites work: Tutorial on large deviations for the binomial distribution
cites work: Shifted primes without large prime factors
cites work: A note on matrix rigidity
cites work: Matrix rigidity of random Toeplitz matrices
cites work: Using elimination theory to construct rigid matrices
cites work: Q5690468
cites work: On the rigidity of Vandermonde matrices
cites work: Complexity Lower Bounds using Linear Algebra
cites work: Q4164821
DOI: 10.4086/TOC.2020.V016A020
Recommended article: Matrix rigidity and the Croot-Lev-Pach lemma
Recommended article: Theory and Applications of Models of Computation
Recommended article: Probabilistic rank and matrix rigidity
Recommended article: Matrix rigidity
Recommended article: On the rigidity of Vandermonde matrices
copyright license: Creative Commons Attribution 4.0 International
description: scientific article; zbMATH DE number 7330816