ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let MM be any n×nn\times n symmetric matrix with entries satisfying 0≤Mij≤10\leq M_{ij}\leq1, and let 1\mathbf{1} be the nn-dimensional all-ones vector. Matrix power inequality conjecture. For every α≥0\alpha\geq0,

1TMα1≤1T(M1)α.\mathbf{1}^{\mathsf T}M^\alpha\mathbf{1}\leq\mathbf{1}^{\mathsf T}(M\mathbf{1})^\alpha.

The paper proposes this inequality as a sufficient route to proving the preceding trace and row-sum bounds when q>1q>1. Its validity is not established in the source.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.