The strict upper-bound conjecture for graph Ky Fan norms
The strict upper-bound conjecture for graph Ky Fan norms
Let denote the asymptotic normalized maximum of the Ky Fan -norm over graphs, as defined in the paper.
Strict upper-bound conjecture. There exist infinitely many positive integers such that
The preceding results establish equality for square values under the stated regular-matrix condition; the conjecture concerns infinitely many nonsquare cases where the general upper bound is not attained.
Sources & referencesView supporting material
Primary source
Vladimir Nikiforov, “Beyond graph energy: norms of graphs and matrices”, arXiv:1510.02850 (2016).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.