Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 38 min ago
PreprintCC BY 4.0arXiv

The Maximum Permanent of a Stochastic Matrix of Bounded Rank

Abstract

Let A be a stochastic n× n matrix with rankA≤ k, where 1≤ k≤ n. Write n=qk+s, where 0≤ s<k. The author conjectured in 2018 that perA≤ (q!/qq)k−s((q+1)!/(q+1)q+1)s, with equality if and only if A=P(Jq⊕(k−s)⊕ Jq+1⊕ s)Q, where P,Q are permutation matrices and Jt is the t× t matrix with every entry 1/t. We prove this conjecture in full.

Related

  1. The Maximum Diagonal Product of a Stochastic Matrix of Bounded Rank
    Yair Lavi
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. Equality cases for matrix spaces with bounded-rank commutators
    Zhi-Lin Zhang
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  3. A deterministic (1+ε)n approximation for the permanent of a nonnegative matrix
    Dingding Dong, Vishesh Jain
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. An Exponential Lower Bound for the Permanent of Random Bernoulli Matrix
    Yiming Chen
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  5. Maximum principle for quasilinear SPDE’s on a bounded domain without regularity assumptions
    Laurent Denis, Anis Matoussi
    Stochastic Processes and their ApplicationsPeer-reviewedLicence not statedFull text15 citedGeneral mathematicsHAL
BibTeX
@misc{lavi2026maximum,
  title = {{The Maximum Permanent of a Stochastic Matrix of Bounded Rank}},
  author = {Yair Lavi},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.27911},
  eprint = {2609.27911},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.27911},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - The Maximum Permanent of a Stochastic Matrix of Bounded Rank
AU  - Yair Lavi
PY  - 2026
DA  - 2026/09/01
PB  - arXiv
DO  - 10.48550/arxiv.2609.27911
UR  - https://arxiv.org/abs/2609.27911
AB  - Let A be a stochastic n× n matrix with rankA≤ k, where 1≤ k≤ n. Write n=qk+s, where 0≤ s<k. The author conjectured in 2018 that perA≤ (q!/q^q)^k−s((q+1)!/(q+1)^q+1)^s, with equality if and only if A=P(J_q^⊕(k−s)⊕ J_q+1^⊕ s)Q, where P,Q are permutation matrices and J_t is the t× t matrix with every entry 1/t. We prove this conjecture in full.
ER  -