Pith. sign in

REVIEW 1 cited by

Interlacing Families III: Sharper Restricted Invertibility Estimates

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1712.07766 v1 pith:VZ5UD47Q submitted 2017-12-21 math.FA

Adam W. Marcus , Daniel A. Spielman , Nikhil Srivastava This is my paper · ORCID
classification math.FA
keywords boundsfamiliesinterlacinginvertibilitynumberpolynomialsrankrestricted
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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 smallest zeros of Jacobi and associated Laguerre polynomials.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Well-invertible column subsets of sparse matrices are rare

    math.PR 2026-07 accept novelty 7.5 of 10

    Under mild sparsity and overlap assumptions, almost every proportional-size column subset of a sparse matrix has smallest singular value o(1), so constant-sparsity SparseStack maps are not (Ω(k), Ω(1))-OSI.

Pith tools