A strict improvement for the asymptotic Ky Fan eigenvalue sum

From papers

For a graph GG, let τk(n)\tau_k(n) denote the maximum, over graphs on nn vertices, of the sum of the kk largest eigenvalues of GG, and let

τk=limnτk(n)n\tau_k=\lim_{n\to\infty}\frac{\tau_k(n)}{n}

for fixed k1k\geq 1. The asymptotic Ky Fan eigenvalue-sum conjecture. For any k2k\geq 2, there is an εk>0\varepsilon_k>0 such that

τk<12(1+kεk).\tau_k<\frac{1}{2}\left(1+\sqrt{k}-\varepsilon_k\right).

The conjecture proposes a positive improvement over the known general upper bound τk12(1+k)\tau_k\leq \frac{1}{2}(1+\sqrt{k}). Determining τk\tau_k is open for every k2k\geq 2, so the conjecture remains open.

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

Vladimir Nikiforov, “Extrema of graph eigenvalues”, arXiv:1502.00359 (2015).

Solutions 0

No solutions have been posted yet.