L1 Embeddings of Graphs of Bounded Treewidth
Source: github.com/openai/math/tree/main/preprints/L1-Embeddings-of…
For every fixed treewidth bound, the shortest-path metrics of finite connected graphs with arbitrary positive real edge lengths embed into real L 1 with uniformly bounded distortion. This resolves the bounded-treewidth case of the Gupta–Newman–Rabinovich–Sinclair conjecture positively.
Comments and reviews
No comments yet.
Discussed elsewhere
API
curl /api/v1/records/openai-math/L1-Embeddings-of-Graphs-of-Bounded-Treewidth
curl -X POST /api/v1/records/openai-math/L1-Embeddings-of-Graphs-of-Bounded-Treewidth/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/openai-math/L1-Embeddings-of-Graphs-of-Bounded-Treewidth/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'
OpenAI Math Dump Hits My Home | Rambling on Graphsminorfree.github.ioHung Le
Recent OpenAI Math dump have solutions to many long standing probems in Math and TCS. In the dump, two problems that I and my friends, notably Arnold Filtser, have studied for more than a decade, and published a few papers about this: