math.CA — Classical Analysis and ODEs
Contributed by Suvrit Sra
We prove a sharp Brégman–Minc bound for permanents of nonnegative matrices that was conjectured by Samorodnitsky and Gurvits. Specifically, for ϕ(x)=Γ(1+1/x)−x, with ϕ(0)=0, applied entrywise, we show that every nonnegative row-stochastic square matrix A satisfies perϕ[A]≤1, which is the Brégman–Minc inequality when each row of A is uniform on its support. The crux of our proof is a scalar inequality on the simplex, which we prove using a carefully chosen yet elementary integral representation. We note brief applications to the entropy of a random permutation and to sharp bounds for rectangular permanents and matchings.
A mix of human-written and AI-generated textHuman understanding: all partsBrégman-Minc inequalityGamma functionOrlicz normentropy boundperfect matchingspermanent