Second-largest eigenvalue conjecture for balanced complete-graph configurations

Let d3d\geq 3, and let p:[n]Rdp:[n]\to{\mathbb R}^d satisfy p(i)=1\|p(i)\|=1 for every i[n]i\in[n] and

i=1np(i)=0.\sum_{i=1}^n p(i)=0.

Assume that the image of pp has size at least 33. Second-largest eigenvalue conjecture. The second largest eigenvalue of L(Kn,p)L(K_n,p) is n/2n/2, and its multiplicity is exactly n1n-1. This conjecture concerns the spectrum of the Laplacian associated with balanced point configurations; the preceding argument establishes that n/2n/2 has multiplicity at least n1n-1, while the asserted second-largest-eigenvalue and exact-multiplicity statement remains open.

Sources & referencesView supporting material

Primary source

Alan Lew, Eran Nevo, Yuval Peled and Orit E. Raz, “On the d-dimensional algebraic connectivity of graphs”, arXiv:2205.05530 (2022).

Additional references

4 papers in this index state this conjecture (2008–2022). The statement above is taken from the most recent of them; the others are arXiv:2006.12994, arXiv:1706.01933, arXiv:0804.1285.

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

No solutions have been posted yet.