Maximum diagonal product conjecture for bounded-rank stochastic matrices
Lavi's conjecture: Let , write with integers and , and let be either row-stochastic, meaning for every , or column-stochastic, meaning for every . If , then for every permutation of , . The problem also asks for a complete classification of all matrices and permutations for which equality holds.
References
- The Maximum Diagonal Product of a Stochastic Matrix of Bounded Rank — arXiv — Yair Lavi
Source: arXiv
Progress summary
A 2026 preprint claims to prove the conjecture and classify all equality cases, but the claim has not been independently checked.
The conjecture asks for a sharp upper bound on every diagonal product of a row- or column-stochastic matrix of rank at most , where , together with a classification of all equality cases. Yair Lavi formulated it in 2018 as Conjecture 4.
Known results
- Lavi (2018): stated the bound and the conjectured extremizers, but did not prove them.
2026 preprint claim
A 2026 preprint by Lavi reports a proof of the diagonal-product bound for all such matrices and a complete equality classification. The claim is unrefereed and has no independent mathematical assessment in the retrieved sources. A separate 2026 preprint proves only the analogous permanent statement, not this conjecture.
Current status (as of November 2026): A 2026 preprint claims the general bound and equality classification, while the 2018 conjecture remains unverified because no independent assessment was found.
Solutions 0
No solutions have been posted yet.