vix.ing · top · new · best · stats · spec

The largest Laplacian eigenvalue and the balancedness of simplicial complexes

2024/05/29 by Yi-Zheng Fan, Fan, Yi-Zheng, Hui-Feng Wu +3 · 3 citations
Computer Science · Mathematics · #05C65 #05E45 #47J10 #55U05 #Combinatorics (math.CO) #FOS: Mathematics #Geometric and Algebraic Topology #Graph theory and applications #Topological and Geometric Data Analysis

paper · pdf · doi:10.48550/arxiv.2405.19078

openalex publication_date 2024/05/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let K be a simplical complex, and let Liup(K), Qiup(K) be the i-th up Laplacian and signless Laplacian of K, respectively. In this paper we proved that the largest eigenvalue of Liup(K) is not greater than the largest eigenvalue of Qiup(K); furthermore, if K is (i+1)-path connected, then the equality holds if and only if the i-th incidence signed graph Bi(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 Bi(K) being balanced.

Cited by

Related