A strict asymptotic bound conjecture for Ky Fan graph eigenvalue sums

From papers

For a graph GG of order nn, let λ1(G)λ2(G)\lambda_1^*(G)\geq\lambda_2^*(G)\geq\cdots be the eigenvalues of its adjacency matrix in nonincreasing order of absolute value, and let ξk(n)\xi_k(n) be the maximum of λ1(G)++λk(G)\lambda_1^*(G)+\cdots+\lambda_k^*(G) over graphs of order nn. Define

ξk=limnξk(n)n.\xi_k=\lim_{n\rightarrow\infty}\frac{\xi_k(n)}{n}.

Strict asymptotic bound conjecture. There exist infinitely many integers kk such that

ξk<1+k2.\xi_k<\frac{1+\sqrt{k}}{2}.

The upper bound is attained asymptotically when kk is a square under the matrix condition discussed in the source, while the conjecture concerns infinitely many nonsquare cases where a strict inequality should hold.

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.