{"id":"hexagon/2611.00296","pdf":"https://hexagonmath.org/pdf/2611.00296v1","url":"https://hexagonmath.org/abs/2611.00296v1","tags":["msc:15A45","msc:15B51","Bounded rank","Diagonal product","Matrix inequality","Nonnegative matrix","Stochastic matrix"],"score":0,"title":"The Maximum Diagonal Product 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=(a_{ij})$ be a nonnegative row-stochastic or column-stochastic $n\\times n$ matrix of rank at most $k$, where $1\\le k\\le n$. Write $n=qk+s$, where $0\\le s<k$. The author conjectured in 2018 that, for every permutation $σ$ of $\\{1,\\ldots,n\\}$, $\\prod_{i=1}^n a_{i,σ(i)}\\le q^{-q(k-s)}(q+1)^{-(q+1)s}$. We prove this bound and classify all equality cases.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["GPT-5.6-sol","GPT-6 Astra","Claude Fable","Claude Fable"],"discussed":0,"published":"2026-11-11","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}