arXiv:2610.20775
The Lovász number is not alone: a continuum of Rényi points in the entanglement-assisted spectrum of graphs
Nidhal Mghirbi, Seth Douglas
Abstract
Li and Zuiddam's entanglement-assisted asymptotic spectrum of graphs consists of the normalized graph parameters that are additive under disjoint unions, multiplicative under strong products and monotone under entanglement-assisted cohomomorphisms; the entanglement-assisted Shannon capacity is their pointwise minimum. To our knowledge, the Lovász number $\vartheta$ was its only known element. We find a continuum of others. Three quantities of Duan and Winter, $\log_2\vartheta$, the minimal Holevo capacity $C_{\min}$ and the logarithm of the no-signalling simulation cost $Σ$, are the smallest information radii of classical-quantum channels compatible with a graph, measured with Petz-Rényi divergences of orders $0$, $1$ and $2$. At order zero this is due to Schrijver (as credited by Dalai) and to Duan and Winter; at order one it is the min-max formula for the Holevo capacity. Interpolating in the order gives a family $\vartheta_α$, $0\leα\le2$, and we prove that every member lies in the spectrum. The main step, multiplicativity under strong products for channels that need not factor, follows from an exact nesting identity for compressions. Sandwiched Rényi radii of order $β\in[1/2,\infty]$ give the same family, at $α=2-1/β$. On the five-cycle the family takes every value in $[\sqrt5,5/2]$. A Hilbert-Schmidt inequality for the pentagon gives $C_{\min}(C_5)=\log_2(5/2)$, proving a conjecture of Duan and Winter. We also settle the two open links of their inequality chain: the graph-level no-signalling simulation rate always equals its single-letter value $\log_2Σ(G)$, and a 32-vertex graph from the Mermin-Peres magic square has $C_{\min}<\log_2Σ$, certified in exact rational arithmetic. Finally, $Σ$ never exceeds the projective rank of the complement; a rank inequality for the same square makes this strict on a 1440-vertex graph.
AI Summary
The paper asks whether the Lovász number $\vartheta$ is the only point in the entanglement-assisted asymptotic spectrum of graphs. It defines $\vartheta_\alpha$, for $0\le\alpha\le2$, by minimizing Petz–Rényi information radii over compatible classical–quantum channels and center states. The endpoints are $\vartheta_0=\vartheta$, $\vartheta_1=2^{C_{\min}}$, and $\vartheta_2=\Sigma$, linking the Lovász number, minimal Holevo capacity, and no-signalling simulation cost. Every $\vartheta_\alpha$ is proved additive under disjoint union, multiplicative under strong product, and monotone under entanglement-assisted cohomomorphisms. Multiplicativity handles arbitrary joint representations using an exact nesting identity for power compressions; monotonicity follows from data processing. Sandwiched Rényi radii yield the same family under $\alpha=2-1/\beta$. On $C_5$, the family continuously covers $[\sqrt5,5/2]$, establishing continuum many distinct spectral points, and equals $5/2$ for $\alpha\ge1/2$. A dimension-independent Hilbert–Schmidt inequality proves the pentagon conjecture $C_{\min}(C_5)=\log_2(5/2)$. Multiplicativity also establishes the single-letter graph-level simulation rate $S_{0,\mathrm{NS}}(G)=\log_2\Sigma(G)$. Exact rational certificates separate $2^{C_{\min}}\le6.186983\ldots<6.194232\ldots\le\Sigma$ on a 32-vertex magic-square graph. A contextual rank inequality separates $\Sigma$ from complementary projective rank on 1,440 vertices: $\Sigma\le240.2002\ldots<240.2033\ldots\le\xi_f(\overline G)$. All constructed points dominate $\vartheta$, leaving $\Theta_*=\vartheta$ unresolved. The exact pentagon curve below order $1/2$, left continuity at orders $1$–$2$, spectral membership above order two, and extensions to non-commutative graphs remain open.
Generative AI tools were used throughout the research and preparation of this manuscript, including for mathematical exploration, proof development and critique, literature organization, computational assistance, and drafting.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 35 pages, 5 figures, 1 table. Version 1.2.1 of Zenodo record https://doi.org/10.5281/zenodo.22983498; code: https://github.com/Apsiape/the-lovasz-number-is-not-alone