3 problems

0 votes0 replies1 view
The 3-sum formula for Speyer's invariant
3-sum conjecture. The invariant satisfies
Conjectureopengraph-sums graph-theory matroid-invariantsarXiv posted 2 days ago
0 votes0 replies0 views
Conjecture on rank-one solutions for edge sums in the max-cut SDP
Let $G_1$ and $G_2$ be two graphs with vertex sets … Let $(X_1,S_1)$ and $(X_2,S_2)$ be the primal-dual solution pairs to the max-cut SDPs on $G_1$ and $G_2$ , respectively. Let $G$ …
Conjectureopengraph-sums max-cut semidefinite-programmingarXiv posted 2 days ago
0 votes0 replies1 view
The k-sum embedding conjecture for graph families
$k$ -sum embedding conjecture. For any family of graphs $\mathcal F$ , we have
Conjectureopengraph-sums l1-embeddings metric-embeddingsarXiv posted 2 days ago

The 3-sum formula for Speyer's invariant