arXiv (All)
open access
Unique Minimizers for Permanents, Mixed Discriminants, and Log-concave Polynomials
The permanent and mixed discriminant of positive matrices are classic problems for which we do not expect an efficient algorithm for exact computation. Thus much work has been done to understand how well we can bound and approximately compute these quantities. One line of research in this area begin
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
- Computing matrix functions associated with a Hermitian-definite pencil#925830
- Bounded Integer Quadratic Programming through Parallelepiped Covers and Discrete Convic Optimization#1011604
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms#144202
- Negativity-preserving transforms of tuples of symmetric matrices#139058
- Bounded Ratios of Lorentzian Polynomials I: The Ternary Theory and Optimal Bounding Constants#1110339
Record · ID 1035053
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