We use the method of interlacing families of polynomials to derive a simple proof of Bourgain and Tzafriri's Restricted Invertibility Principle, and then to sharpen the result in two ways. We show that the stable rank can be replaced by the Schatten 4-norm stable rank and that tighter bounds hold when the number of columns in the matrix under consideration does not greatly exceed its number of rows. Our bounds are derived from an analysis of the smallest zeros of Jacobi and associated Laguerre polynomials
AbstractFor a given matrix with dominant diagonal, a number of convenient upper and lower bounds for...
This version proposes an improved bound and more comparisons with previous worksInternational audien...
This version proposes an improved bound and more comparisons with previous worksInternational audien...
This thesis uses the method of interlacing polynomials to study the behaviour of eigenvalues of a ma...
Click on the link to view the abstract.Keywords: Interlacing properties; zeros; Jacobi polynomials; ...
We study the rank of complex sparse matrices in which the supports of different columns have small i...
Several matrix norms of the classical Frobenius companion matrices of a monic polynomial p(z) have b...
We investigate two main overarching topics in the theory of stable polynomials.1. Differential and D...
Several matrix norms of the classical Frobenius companion matrices of a monic polynomial p(z) have b...
We investigate two main overarching topics in the theory of stable polynomials.1. Differential and D...
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of ...
This version proposes an improved bound and more comparisons with previous worksInternational audien...
This version proposes an improved bound and more comparisons with previous worksInternational audien...
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of ...
This version proposes an improved bound and more comparisons with previous worksInternational audien...
AbstractFor a given matrix with dominant diagonal, a number of convenient upper and lower bounds for...
This version proposes an improved bound and more comparisons with previous worksInternational audien...
This version proposes an improved bound and more comparisons with previous worksInternational audien...
This thesis uses the method of interlacing polynomials to study the behaviour of eigenvalues of a ma...
Click on the link to view the abstract.Keywords: Interlacing properties; zeros; Jacobi polynomials; ...
We study the rank of complex sparse matrices in which the supports of different columns have small i...
Several matrix norms of the classical Frobenius companion matrices of a monic polynomial p(z) have b...
We investigate two main overarching topics in the theory of stable polynomials.1. Differential and D...
Several matrix norms of the classical Frobenius companion matrices of a monic polynomial p(z) have b...
We investigate two main overarching topics in the theory of stable polynomials.1. Differential and D...
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of ...
This version proposes an improved bound and more comparisons with previous worksInternational audien...
This version proposes an improved bound and more comparisons with previous worksInternational audien...
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of ...
This version proposes an improved bound and more comparisons with previous worksInternational audien...
AbstractFor a given matrix with dominant diagonal, a number of convenient upper and lower bounds for...
This version proposes an improved bound and more comparisons with previous worksInternational audien...
This version proposes an improved bound and more comparisons with previous worksInternational audien...