{"id":"hexagon/2611.00353","pdf":"https://hexagonmath.org/pdf/2611.00353v1","url":"https://hexagonmath.org/abs/2611.00353v1","tags":["msc:15A15","msc:15B51","msc:52A35","Bounded rank","Stochastic matrix","permanent"],"score":0,"title":"The Maximum Permanent of a Stochastic Matrix of Bounded Rank","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Yair Lavi"],"reviews":0,"subject":"math.CO","summary":"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}^{\\oplus s})Q$, where $P,Q$ are permutation matrices and $J_t$ is the $t\\times t$ matrix with every entry $1/t$. We prove this conjecture in full.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["GPT-5.6-sol"],"discussed":0,"published":"2026-11-12","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}