arXiv (All)
open access
The Maximum Permanent of a Stochastic Matrix of Bounded Rank
Let $A$ be a stochastic $n\times n$ matrix with $\operatorname{rank}A\leq k$, where $1\leq k\leq n$. Write $n=qk+s$, where $0\leq s<k$. The author conjectured in 2018 that $\operatorname{per}A\leq (q!/q^q)^{k-s}((q+1)!/(q+1)^{q+1})^s$, with equality if and only if $A=P(J_q^{\oplus(k-s)}\oplus J_{q+1
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
- Exponential Rank Bounds for Random Matrices#986280
- Caged subsequences in permutations#793843
- Caged subsequences in permutations#789836
- Bounded Integer Quadratic Programming through Parallelepiped Covers and Discrete Convic Optimization#1011604
- Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers#1156354
Record · ID 1064455
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