Open structure problem for the entanglement-assisted asymptotic spectrum of graphs
Determine the set of all normalized graph parameters on finite graphs such that , , , , and implies , where denotes entanglement-assisted cohomomorphism and denotes the strong graph product. In particular, determine whether the spectrum consists only of the Lovász number , or characterize all additional spectrum points.
References
- The Lovász number is not alone: a continuum of Rényi points in the entanglement-assisted spectrum of graphs — arXiv — Nidhal Mghirbi, Seth Douglas
Source: arXiv
Progress summary
A new paper claims many additional examples and settles several related questions, but the full structure of the spectrum remains unknown.
The problem asks for a description of all parameters in the entanglement-assisted asymptotic spectrum of graphs. Earlier work conjectured that the Lovász number might be the only such parameter, while also recording competing conjectures about related capacities.
Known results
- The Lovász number is a spectrum point; the 2018 literature stated that no other classical points had been found and conjectured for every graph .
- The spectrum gives the dual characterization .
- Earlier work disproved equality between one-shot entanglement-assisted zero-error capacity and , while leaving the asymptotic gap open.
October 14, 2026 claimed progress
Mghirbi and Douglas introduce for and claim spectrum membership, , and resolutions of the pentagon and two simulation-rate links. These claims are not independently assessed in the retrieved evidence, and the paper does not claim a complete spectrum characterization.
Current status (as of October 2026): the spectrum has claimed new points and related conjectural links, but its complete structure and the claimed results remain unverified.
Solutions 0
No solutions have been posted yet.