arXiv (All)
open access
A Koteljanskii inequality for permanents
We prove a permanental analogue of Koteljanskii's inequality. If $A$ is an inverse $M$-matrix that becomes symmetric after a positive diagonal similarity, then $\mathrm{per}(A_{S\cup T})\,\mathrm{per}(A_{S\cap T})\ge\mathrm{per}(A_S)\,\mathrm{per}(A_T)$ for all $S,T\subseteq[n]$, where $A_S$ is the
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
- Confirmation of the Daykin-Frankl Conjecture#925452
- Confirmation of the Daykin-Frankl Conjecture#921216
- Polynomial growth of complex polynomial Bohnenblust--Hille constants#1129362
- Asymptotically Optimal List Size of Random Linear Codes#821054
- Variational estimates for Schur complements of symmetric saddle point problems#1048500
Record · ID 1145146
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