Metraipolis › archive › dc_0a202886ea89
Unique Minimizers for Permanents, Mixed Discriminants, and Log-concave Polynomials — arXiv:2609.21083
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.21083
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T02:05:01.576Z
- SHA-256 of the archived text
4e4618c5a8ed4c131bc9dbd2590a2e8dbd94a2c5e7e1ea0ca666da5769c64de7- Stable URL of this page
https://metraipolis.com/documento/dc_0a202886ea89
How to cite
Unique Minimizers for Permanents, Mixed Discriminants, and Log-concave Polynomials — arXiv:2609.21083 — arXiv (en), https://arxiv.org/abs/2609.21083 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0a202886ea89 (Metraipolis archive dc_0a202886ea89, sha256 4e4618c5a8ed4c131bc9dbd2590a2e8dbd94a2c5e7e1ea0ca666da5769c64de7)
BibTeX
@misc{dc0a202886ea89,
title = {Unique Minimizers for Permanents, Mixed Discriminants, and Log-concave Polynomials — arXiv:2609.21083},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.21083},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0a202886ea89; sha256 4e4618c5a8ed4c131bc9dbd2590a2e8dbd94a2c5e7e1ea0ca666da5769c64de7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21083. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 begins with the results of the first author, where van der Waerden lower bounds of $\frac{n!}{n^n}$ are proven for doubly stochastic inputs for both problems, using a simple proof via stable polynomials. Along with the bound itself, the same techniques are used to show that the permanent and mixed discriminant are uniquely minimized at a certain natural symmetric input. In this paper, we generalize those results in two ways. First, we extend the unique minimization results beyond doubly stochastic inputs to other marginals which are near doubly stochastic. This yields the first such unique minimization results for the mixed discriminant beyond the doubly stochastic case. We also discuss why one cannot hope similar results to hold in general for all marginals. Second, we extend the unique minimization result for real stable polynomials to strongly log-concave (aka Lorentzian) polynomials in the doubly stochastic case. This captures an analogous previous result on unique minimization for the mixed volume. Finally, we discuss various open problems related to these results.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in math.OC).
Categorie arXiv: Combinatorics (math.CO) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.21083 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T01:45:31.262Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).