The logarithmic psd-rank conjecture for regular polygon slack matrices
The logarithmic psd-rank conjecture for regular polygon slack matrices
Let be the slack matrix of the regular -gon, and let denote its positive semidefinite rank. Logarithmic psd-rank conjecture. The psd-rank of is given by
This conjecture proposes an exact logarithmic formula for the positive semidefinite rank of regular polygon slack matrices. The preceding computations support the formula for the smallest regular polygons and suggest it for , but the statement is not established in the provided text.
Sources & referencesView supporting material
Primary source
Arnaud Vandaele, François Glineur and Nicolas Gillis, “Algorithms for Positive Semidefinite Factorization”, arXiv:1707.07953 (2017).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.