Integer factorization of a positive-definite matrix
Joel A. Tropp

TL;DR
This paper proves that any positive-definite matrix can be decomposed into a sum of outer products of integer vectors with bounded entries, linking matrix properties to integer vector representations.
Contribution
Introduces a novel decomposition of positive-definite matrices into integer vector outer products with bounded entries, connecting matrix condition number and dimension.
Findings
Any positive-definite matrix can be expressed as a positive linear combination of integer outer products.
The entries of these integer vectors are bounded by the geometric mean of the matrix's condition number and its dimension.
This decomposition provides a new perspective on matrix structure and integer representations.
Abstract
This paper establishes that every positive-definite matrix can be written as a positive linear combination of outer products of integer-valued vectors whose entries are bounded by the geometric mean of the condition number and the dimension of the matrix.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · graph theory and CDMA systems · Advanced Optimization Algorithms Research
