The Maximum Diagonal Product of a Stochastic Matrix of Bounded Rank

arXiv:2611.01763 · math.CO · Submitted 2026-11-01 · Read on arXiv

math.CO

Submitted: 2026-11-01

Updated: 2026-11-01

License: http://creativecommons.org/licenses/by/4.0/

The gist: Let A=(a ij) be a nonnegative row-stochastic or column-stochastic n times n matrix of rank at most k, where 1 at most k at most n.

Terminology

Abstract

Let A=(a ij) be a nonnegative row-stochastic or column-stochastic n times n matrix of rank at most k, where 1 at most k at most n. Write n=qk+s, where 0 at most s<k. The author conjectured in 2018 that, for every permutation σ of 1,,n, product from i=1 to n a i,σ(i) at most q-q(k-s)(q+1)-(q+1)s. We prove this bound and classify all equality cases.

Sources

Related papers