Search arXiv⌕ Search

arXiv · 2312.12709

The spectra of Laplace operators on covering simplicial complexes

Abstract

We give a decomposition of the Laplace operator (in matrix form) of a covering simplicial complex as a direct sum of several matrices, one of which is the Laplace operator of the base complex. It follows that the spectrum of a covering simplicial complex is a multiset union of the spectrum of the base simplicial complex and the spectra of other relevant matrices, which implies the spectral inclusion property of Horak and Jost. In the case of a $2$-fold covering, we show that the spectrum is a multiset union of the spectrum of the base complex and that of an incidence-signed simplicial complex, thereby generalizing a result of Bilu and Linial from graphs to simplicial complexes. Additionally, we show that the dimension of the cohomology of a covering complex is greater than or equal to that of the base complex. Our arguments exploit the coverings of incidence graphs of simplicial complexes and the representation theory of permutation groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yi-Zheng Fan, Yi-Min Song, Yi Wang. 2025-07-20. The spectra of Laplace operators on covering simplicial complexes. https://arxiv.org/abs/2312.12709

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗