实射影空间中小码的全局优化
Globally optimizing small codes in real projective spaces
摘要：
对于$d\in\{5,6\}$，我们对$\mathbf{RP}^{d-1}$中的$d + 2$点的排列进行分类，使其最小距离尽可能大。要做到这一点，我们利用矩阵和凸分析的思想，以确定最好的可能的代码，包含等角线，我们引入了一个概念，近似Positivstellenetrance证书，促进数值逼近的Stengle的Positivstellenetrance证书诚实的证书。
英文摘要：
For $d\in\{5,6\}$, we classify arrangements of $d + 2$ points in $\mathbf{RP}^{d-1}$ for which the minimum distance is as large as possible. To do so, we leverage ideas from matrix and convex analysis to determine the best possible codes that contain equiangular lines, and we introduce a notion of approximate Positivstellensatz certificates that promotes numerical approximations of Stengle's Positivstellensatz certificates to honest certificates.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
