The logarithmic psd-rank conjecture for regular polygon slack matrices

Let SnS_n be the slack matrix of the regular nn-gon, and let rankpsd(Sn)\operatorname{rank}_{\operatorname{psd}}(S_n) denote its positive semidefinite rank. Logarithmic psd-rank conjecture. The psd-rank of SnS_n is given by

rankpsd(Sn)=1+log2(n).\operatorname{rank}_{\operatorname{psd}}(S_n)=1+\lceil\log_2(n)\rceil.

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 n7n\geq 7, 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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.