Equivalent trace and row-sum bounds for Vendi Score and LCR

From papers

Let ZZ be an n×nn\times n positive semidefinite similarity matrix as above, and let 1\mathbf{1} denote the nn-dimensional all-ones vector. Equivalent bounds conjecture. For q>1q>1,

tr(Zq)i(jZij)q1=1T(Z1)q1,\operatorname{tr}(Z^q)\leq\sum_i\left(\sum_j Z_{ij}\right)^{q-1}=\mathbf{1}^{\mathsf T}(Z\mathbf{1})^{q-1},

while for q<1q<1,

tr(Zq)1T(Z1)q1.\operatorname{tr}(Z^q)\geq\mathbf{1}^{\mathsf T}(Z\mathbf{1})^{q-1}.

These inequalities would imply the Vendi Score–LCR bound for all orders other than q=1q=1, potentially with the missing case obtained by continuity. They are presented as an approach to proving the preceding conjecture and are not established in the source.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Phuc Nguyen, Josiah Couch, Rahul Bansal, Alexandra Morgan, Chris Tam, Miao Li, Rima Arnaout and Ramy Arnaout, “Which Similarity-Sensitive Entropy (Sentropy)?”, arXiv:2511.03849 (2026).

Solutions 0

No solutions have been posted yet.