Rigidity of a simple extended lower triangular matrix

Authors:
Meena Mahajan;Jayalal Sarma M.N.
Affiliations:
The Institute of Mathematical Sciences, Chennai 600 113, India;The Institute of Mathematical Sciences, Chennai 600 113, India
Venue:
Information Processing Letters
Year:
2008

Citing 7
Cited 0

Some combinatorial-algebraic problems from complexity theory

Discrete Mathematics - Special issue: trends in discrete mathematics
A remark on matrix rigidity

Information Processing Letters
Some structural properties of low-rank matrices related to computational complexity

Theoretical Computer Science - Selected papers in honor of Manuel Blum
On the rigidity of Vandermonde matrices

Theoretical Computer Science
Spectral methods for matrix rigidity with applications to size-depth tradeoffs and communication complexity

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Quadratic lower bounds on matrix rigidity

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
On the complexity of matrix rank and rigidity

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

Quantified Score

Hi-index	0.90

Visualization

Abstract

For the all-ones lower triangular matrices, the upper and lower bounds on rigidity are known to match [P. Pudlak, Z. Vavrin, Computation of rigidity of order n^2/r for one simple matrix, Comment Math. Univ. Carolin. 32 (2) (1991) 213-218]. In this short note, we apply these techniques to the all-ones extended lower triangular matrices, to obtain upper and lower bounds with a small gap between the two; we show that the rigidity is @q(n^2r).