Papers › Uniqueness of size-2 positive semidefinite matrix factorizations
Uniqueness of size-2 positive semidefinite matrix factorizations
Kristen Dawson, Serkan Hoşten, Kaie Kubjas, Lilja Metsälampi
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We characterize when a size-2 positive semidefinite (psd) factorization of a positive matrix of rank 3 and psd rank 2 is unique. The characterization is obtained using tools from rigidity theory. In the first step, we define s-infinitesimally rigid psd factorizations and characterize 1- and 2-infinitesimally rigid size-2 psd factorizations. In the second step, we connect 1- and 2-infinitesimal rigidity of size-2 psd factorizations to uniqueness via global rigidity. We also prove necessary conditions on a positive matrix of rank 3 and psd rank 2 to be on the topological boundary of all nonnegative matrices with the same rank conditions.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections