The largest normalized Laplacian eigenvalue and incidence balancedness of simplicial complexes
Abstract
Let K be a simplicial complex, and let iup(K) be the i-th up normalized Laplacian of K. Horak and Jost showed that the largest eigenvalue of iup(K) is at most i+2, and characterized the equality case by the orientable or non-orientable circuits. In this paper, by using the balancedness of signed graphs, we show that iup(K) has an eigenvalue i+2 if and only if K has an (i+1)-path connected component K' such that the i-th signed incidence graph Bi(K') is balanced, which implies Horak and Jost's characterization. We also characterize the multiplicity of i+2 as an eigenvalue of iup(K), which generalizes the corresponding result in graph case. Finally we gave some classes of infinitely many simplicial complexes K with iup(K) having an eigenvalue i+2 by using wedge, Cartesian product and duplication of motifs.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.