The notion of matrix rigidity was introduced by L. Valiant in 1977. He proved a theorem that relates the rigidity of a matrix to the complexity of the linear map that it defines, and proposed to use this theorem to prove lower bounds on the complexity of the Discrete Fourier Transform. In this thesis, I study this problem from a geometric point of view. We reduce to the study of an algebraic variety in the space of square matrices that is the union of linear cones over the classical determinantal variety of matrices of rank not higher than a fixed threshold. We discuss approaches to this problem using classical and modern algebraic geometry and representation theory. We determine a formula for the degrees of these cones and we study a metho...
The concept of matrix rigidity was first introduced by Valiant in [Friedman, 1993]. Roughly speaking...
AbstractThe rigidity of a matrix measures the number of entries that must be changed in order to red...
AbstractThe rigidity function RA(r) of a matrix A is the minimum number of entries of A that must be...
Consider the following problem: Given an n×n matrix A and an input x, compute Ax. This problem has ...
AbstractThe rigidity of a matrix M is the function RM(r), which, for a given r, gives the minimum nu...
A square matrix V is called rigid if every matrix V ′ obtained by altering a small number of entries...
The rigidity of a matrix A for a target rank r over a field F is the minimum Hamming distance betwee...
A square matrix V is called rigid if every matrix V\u27 obtained by altering a small number of entri...
The rigidity of a matrix $A$ for target rank $r$ is the minimum number of entries of $A$ that must b...
Original manuscript September 23, 2012The rigidity of a matrix A for target rank r is the minimum nu...
The rigidity of a matrix measures the number of entries that must be changed in order to reduce its ...
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, ...
The rigidity of a matrix A for target rank r is the minimum number of entries of A that need to be c...
Since Valiant’s establishment of matrix rigidity to analyse circuit complexity, various contribution...
. The rigidity of a matrix is defined to be the number of entries in the matrix that have to be chan...
The concept of matrix rigidity was first introduced by Valiant in [Friedman, 1993]. Roughly speaking...
AbstractThe rigidity of a matrix measures the number of entries that must be changed in order to red...
AbstractThe rigidity function RA(r) of a matrix A is the minimum number of entries of A that must be...
Consider the following problem: Given an n×n matrix A and an input x, compute Ax. This problem has ...
AbstractThe rigidity of a matrix M is the function RM(r), which, for a given r, gives the minimum nu...
A square matrix V is called rigid if every matrix V ′ obtained by altering a small number of entries...
The rigidity of a matrix A for a target rank r over a field F is the minimum Hamming distance betwee...
A square matrix V is called rigid if every matrix V\u27 obtained by altering a small number of entri...
The rigidity of a matrix $A$ for target rank $r$ is the minimum number of entries of $A$ that must b...
Original manuscript September 23, 2012The rigidity of a matrix A for target rank r is the minimum nu...
The rigidity of a matrix measures the number of entries that must be changed in order to reduce its ...
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, ...
The rigidity of a matrix A for target rank r is the minimum number of entries of A that need to be c...
Since Valiant’s establishment of matrix rigidity to analyse circuit complexity, various contribution...
. The rigidity of a matrix is defined to be the number of entries in the matrix that have to be chan...
The concept of matrix rigidity was first introduced by Valiant in [Friedman, 1993]. Roughly speaking...
AbstractThe rigidity of a matrix measures the number of entries that must be changed in order to red...
AbstractThe rigidity function RA(r) of a matrix A is the minimum number of entries of A that must be...