DeepAI AI Chat
Log In Sign Up

Improved upper bounds for the rigidity of Kronecker products

by   Bohdan Kivva, et al.

The rigidity of a matrix A for target rank r is the minimum number of entries of A that need to be changed in order to obtain a matrix of rank at most r. Matrix rigidity was introduced by Valiant in 1977 as a tool to prove circuit lower bounds for linear functions and since then this notion has also found applications in other areas of complexity theory. Recently (arXiv 2021), Alman proved that for any field 𝔽, d≥ 2 and arbitrary matrices M_1, …, M_n ∈𝔽^d× d, one can get a d^n× d^n matrix of rank ≤ d^(1-γ)n over 𝔽 by changing only d^(1+ε) n entries of the Kronecker product M = M_1⊗ M_2⊗…⊗ M_n, where 1/γ is roughly 2^d/ε^2. In this note we improve this result in two directions. First, we do not require the matrices M_i to have equal size. Second, we reduce 1/γ from exponential in d to roughly d^3/2/ε^2 (where d is the maximum size of the matrices), and to nearly linear (roughly d/ε^2) for matrices M_i of sizes within a constant factor of each other. For the case of matrices of equal size, our bound matches the bound given by Dvir and Liu (Theory of Computing, 2020) for the rigidity of generalized Walsh–Hadamard matrices (Kronecker powers of DFT matrices), and improves their bounds for DFT matrices of abelian groups that are direct products of small groups.


page 1

page 2

page 3

page 4


Kronecker Products, Low-Depth Circuits, and Matrix Rigidity

For a matrix M and a positive integer r, the rank r rigidity of M is the...

Fourier and Circulant Matrices are Not Rigid

The concept of matrix rigidity was first introduced by Valiant in [Val77...

Forbidden formations in 0-1 matrices

Keszegh (2009) proved that the extremal function ex(n, P) of any forbidd...

On the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond

We consider the following variant of the Mortality Problem: given k× k m...

Linear Computation Coding: Exponential Search and Reduced-State Algorithms

Linear computation coding is concerned with the compression of multidime...

Sets of Stochastic Matrices with Converging Products: Bounds and Complexity

An SIA matrix is a stochastic matrix whose sequence of powers converges ...

On Eigenvalue Gaps of Integer Matrices

Given an n× n matrix with integer entries in the range [-h,h], how close...