Three lines proof of the lower bound for the matrix rigidity
Computational Complexity
2007-05-23 v2
Abstract
The rigidity of a matrix describes the minimal number of entries one has to change to reduce matrix's rank to r. We give very simple combinatorial proof of the lower bound for the rigidity of Sylvester (special case of Hadamard) matrix that matches the best known result by de Wolf(2005) for Hadamard matrices proved by quantum information theoretical arguments.
Cite
@article{arxiv.cs/0506081,
title = {Three lines proof of the lower bound for the matrix rigidity},
author = {Gatis Midrijanis},
journal= {arXiv preprint arXiv:cs/0506081},
year = {2007}
}
Comments
4 pages