The largest Laplacian eigenvalue and the balancedness of simplicial complexes

Let K be a simplical complex, and let Lᵢᵘᵖ(K), Qᵢᵘᵖ(K) be the i-th up Laplacian and signless Laplacian of K, respectively. In this paper we proved that the largest eigenvalue of Lᵢᵘᵖ(K) is not greater than the largest eigenvalue of Qᵢᵘᵖ(K); furthermore, if K is $(i+1)$-path connected, then the equality holds if and only if the i-th incidence signed graph Bᵢ(K) of K is balanced. As an application we provided an upper bound for the largest eigenvalue of the i-th up Laplacian of K, which improves the bound given by Horak and Jost and generalizes the result of Anderson and Morley on graphs.We characterized the balancedness of simplicial complexes under operations such as wedge sum, join, Cartesian product and duplication of motifs. For each i ≥ 0, by using wedge sum or duplication of motifs, we can construct an infinitely many $(i+1)$-path connected simplicial complexes K with Bᵢ(K) being balanced.