arXiv (All)
open access
Optimization hierarchies for extremal geometry through complete positivity
Completely positive functions are an extension of completely positive matrices. They are known to characterize maximal spherical codes and maximum-density distance-avoiding subsets of $\mathbb{R}^n$ and certain compact metric spaces. This thesis expands this framework to related classes of problems
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An analogue of a problem of Littlewood#490218
- Nonlinear Rayleigh quotient optimization#998038
- Exponential improvements in Rado's covering problem#1051781
- Regularized Coupling Maps on Matrix Polytopes: From Assignment to Graph Matching and Optimal Transport#794105
- Regularized Coupling Maps on Matrix Polytopes: From Assignment to Graph Matching and Optimal Transport#790086
Record · ID 1129459
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive