Vendi's conjecture that Vendi Score bounds LCR

From papers

Let ZZ be an n×nn\times n positive semidefinite similarity matrix with n>0n>0, symmetric entries in [0,1][0,1], and diagonal entries equal to 11. On the uniform distribution, write LCR at order qq as Dq(Z,p=1n)D_q(Z, p=\frac{1}{n}) and Vendi Score as VSq(Z)\operatorname{VS}_q(Z). Vendi's conjecture. For every q[,+]q\in[-\infty,+\infty],

VSq(Z)Dq(Z,1n).\operatorname{VS}_q(Z)\geq D_q\left(Z,\frac{1}{n}\right).

The conjecture formalizes the empirical observation that Vendi Score is consistently at least as large as LCR, with both measures approaching 11 as the half-distance decreases. The cases q=3q=3 and q=q=\infty are proved in the paper; the general case remains open, including the unresolved case q=1q=1.

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.