Perturbed Identity Matrices Have High Rank: Proof and Applications
From MaRDI portal
Recommendations
- Generic rank-k perturbations of structured matrices
- Proof of a class of matrix rank identities
- Rank equalities for idempotent matrices with applications.
- Estimates of the determinant of a perturbed identity matrix
- scientific article; zbMATH DE number 444359
- Matrices with high completely positive semidefinite rank
- Hyponormality-preserving finite rank perturbations of terraced matrices
- On the eigenvalues of specially low-rank perturbed matrices
- Rank one perturbations of \(H\)-positive real matrices
- scientific article; zbMATH DE number 2163285
Cites work
- Measures of Pseudorandomness for Finite Sequences: Minimal Values
- Min-wise independent permutations
- On (ε,k)‐min‐wise independent permutations
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- On restricted min‐wise independence of permutations
- Problems and results in extremal combinatorics. I.
- Some structural properties of low-rank matrices related to computational complexity
- Symmetrized Chebyshev polynomials
Cited in
(45)- Lower bounds for local versions of dimension reductions
- Ranks of matrices with few distinct entries
- Equiangular lines and spherical codes in Euclidean space
- Fractional L-intersecting families
- Digital almost nets
- Upper bounds on communication in terms of approximate rank
- Nearly orthogonal vectors and small antipodal spherical codes
- Orthonormal representations of \(H\)-free graphs
- On subsets of the hypercube with prescribed Hamming distances
- On the number of ordinary lines determined by sets in complex space
- Approximate nonnegative rank is equivalent to the smooth rectangle bound
- Kolmogorov width and approximate rank
- On deterministic sketching and streaming for sparse recovery and norm estimation
- Near invariance of the hypercube
- Smaller Gershgorin disks for multiple eigenvalues of complex matrices
- Sets of unit vectors with small subset sums
- Fooling pairs in randomized communication complexity
- Sylvester-Gallai type theorems for approximate collinearity
- Improved rank bounds for design matrices and a new proof of Kelly's theorem
- The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
- An exponential lower bound for homogeneous depth four arithmetic formulas
- Lower bounds for depth-three arithmetic circuits with small bottom fanin
- Small Sample Spaces Cannot Fool Low Degree Polynomials
- Approximating sparse binary matrices in the cut-norm
- Why Are Big Data Matrices Approximately Low Rank?
- Classical algorithms from quantum and Arthur-Merlin communication protocols
- Fractional Sylvester–Gallai theorems
- Some upper and lower bounds on PSD-rank
- Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin.
- On (ε,k)‐min‐wise independent permutations
- Around the log-rank conjecture
- Rank of Matrices with Entries from a Multiplicative Group
- Perfect and nearly perfect separation dimension of complete and random graphs
- Polynomial approximation on disjoint segments and amplification of approximation
- Small codes
- Memory capacity of two layer neural networks with smooth activations
- Upper bounds on communication in terms of approximate rank
- Deterministic sparse Fourier transform with an _ guarantee
- Equiangular lines via matrix projection
- On the structure of low-rank matrices approximating the identity matrix
- A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
- Tight bounds for the randomized and quantum communication complexities of equality with small error
- Simple heuristics yield provable algorithms for masked low-rank approximation
- New hardness results for low-rank matrix completion
- Fooling near-maximal decision trees
This page was built for publication: Perturbed Identity Matrices Have High Rank: Proof and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557502)
