The largest Laplacian eigenvalue and the balancedness of simplicial complexes
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913949024256000 |
|---|---|
| author | Fan, Yi-Zheng Wu, Hui-Feng Wang, Yi |
| author_facet | Fan, Yi-Zheng Wu, Hui-Feng Wang, Yi |
| contents | Let $K$ be a simplical complex, and let $\mathcal{L}_i^{up}(K), \mathcal{Q}_i^{up}(K)$ be the $i$-th up Laplacian and signless Laplacian of $K$, respectively. In this paper we proved that the largest eigenvalue of $\mathcal{L}_i^{up}(K)$ is not greater than the largest eigenvalue of $\mathcal{Q}_i^{up}(K)$; furthermore, if $K$ is $(i+1)$-path connected, then the equality holds if and only if the $i$-th incidence signed graph $B_i(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 \ge 0$, by using wedge sum or duplication of motifs, we can construct an infinitely many $(i+1)$-path connected simplicial complexes $K$ with $B_i(K)$ being balanced. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_19078 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The largest Laplacian eigenvalue and the balancedness of simplicial complexes Fan, Yi-Zheng Wu, Hui-Feng Wang, Yi Combinatorics 05E45, 05C65, 47J10, 55U05 Let $K$ be a simplical complex, and let $\mathcal{L}_i^{up}(K), \mathcal{Q}_i^{up}(K)$ be the $i$-th up Laplacian and signless Laplacian of $K$, respectively. In this paper we proved that the largest eigenvalue of $\mathcal{L}_i^{up}(K)$ is not greater than the largest eigenvalue of $\mathcal{Q}_i^{up}(K)$; furthermore, if $K$ is $(i+1)$-path connected, then the equality holds if and only if the $i$-th incidence signed graph $B_i(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 \ge 0$, by using wedge sum or duplication of motifs, we can construct an infinitely many $(i+1)$-path connected simplicial complexes $K$ with $B_i(K)$ being balanced. |
| title | The largest Laplacian eigenvalue and the balancedness of simplicial complexes |
| topic | Combinatorics 05E45, 05C65, 47J10, 55U05 |
| url | https://arxiv.org/abs/2405.19078 |