The spectra of Laplace operators on covering simplicial complexes
Abstract.
In this paper, by the representation theory of symmetric group, we give a decomposition of the Laplace operator (in matrix form) of a covering simplicial complex into the direct sum of some matrices, including the Laplace operator of the underlying simplicial complex. So, the spectrum of a covering simplicial complex can be expressed into a union of the spectrum of the underlying simplicial complex and the spectra of some other matrices, which implies a result of Horak and Jost. In particular, we show that the spectrum of a -fold covering simplicial complex is the union the that of the underlying simplicial complex and that of an incidence-signed simplicial complex, which is an analog of Bilu and Linial’s result on graphs. Finally we show that the dimension of the cohomology group of a covering simplicial complex is greater than or equal to that of the underlying simplicial complex.
Key words and phrases:
Simplicial complex, signed complex, covering, Laplace operator, hypergraph2000 Mathematics Subject Classification:
55U05, 05E45, 47J10, 05C651. Introduction
The study of graph Laplacians has a long and prolific history. It first appeared in a paper by Kirchhoff [18], where he analysed electrical networks and stated the celebrated matrix tree theorem. In the early 1970s Fiedler [13] established a relation between the second smallest eigenvalue and the connectivity of a graph. Since then there has been a number of papers on the Laplacian spectra of graphs; see [26]. The normalized graph Laplacian was introduced by Bottema [4] who studied a transition probability operator on graphs; also see [10] for more introduction.
The graph Laplacian was generalized to simplicial complexes (simply called complex) by Eckmann [9], who proved the discrete version of the Hodge theorem, which can be formulated as
where is the higher order combinatorial Laplacian. There have already been several attempts towards the normalization of the combinatorial Laplace operator; see Chung [11], Taszus [31], Lu and Peng [24], Garland [15]. Horak and Jost developed a general framework for Laplace operators defined in terms of the combinatorial structure of a complex, including the combinatorial Laplacian and the normalized Laplacian.
The graph covering (also called lift) has been introduced and studied in many literatures [25, 28, 2] from the viewpoint of topological or complex. It was generalized to hypergraph covering in [7, 22, 29] in different versions. The complex covering was introduced by Rotman [28], which was adopted by Gustavson [17] to study the Laplacian spectrum. As remarked by Horak and Jost [20], there exist counterexamples to the Universal Lifting Theorem for discrete covering maps from [28] (Theorem 2.1), and the spectral inclusion theorem from [17] (Theorem 4.4). Horak and Jost [20] introduced the notion of strong covering to fix the problems; see Section 3.
By the representation theory of symmetric group, the characteristic polynomial of the adjacency matrix of a covering graph was formulated in a product of the characteristic polynomials of some matrices [27, 12], which implies that the spectrum of the adjacency matrix (simply called the adjacency spectrum) of a covering graph contains that of its underlying graph. In particular, if a graph is a -fold covering (or -lift) of a graph , then the adjacency spectrum of is a multi-set union of that of and that of a signed graph with as underlying graph, which was proved by Bilu and Linial [3] by eigenvector approach. (Note it can also be shown by the sign representation of symmetric group ). Li and Hou [23] applied the above idea to formulate the characteristic polynomials of the Laplacian matrix or normalized Laplacian matrix of a covering graph.
Under the strong covering of complex, Horak and Jost [20] proved that the inclusion relation between the spectrum of a covering complex and that of its underlying complex; see Corollary 4.3. What we are interested in is the remaining eigenvalues of the covering complex except the eigenvalues of the underlying complex. In this paper, by the representation theory of symmetric group, we will give a decomposition of the Laplace operator (in matrix form) of a covering complex into the direct sum of some matrices, including the Laplace operator of the underlying complex. So, the spectrum of a covering complex can be expressed into a union of the spectrum of the underlying complex and the spectra of some other matrices, which implies a result of Horak and Jost [21]. In particular, we show that the spectrum of a -fold covering complex is the union the that of the underlying complex and that of an incidence-signed complex, which is an analog of Bilu and Linial’s result on graphs. Finally we show that the dimension of the homology group of a covering complex is greater than or equal to that of the underlying complex.
2. Preliminaries
2.1. Simplical complex and Laplace operator
Let be a finite set. An abstract simplicial complex (simply called a complex) over is a collection of the subsets of which is closed under inclusion. An -face or an -simplex of is an element of with cardinality . The dimension of an -face is , and the dimension of is the maximum dimension of all faces of . The faces which are maximum under inclusion are called facets. We say is pure if all facets have the same dimension. So, a complex can be considered as a hypergraph with facets as the edges of the hypergraph, and a pure complex will correspond to a uniform hypergraph, where a hypergraph is called uniform if all edges have the same size.
We assume that , called the empty simplex with dimension . Let be the set of all -faces of , where . The -skeleton of , written , is the set of all simplices of of dimension less than or equal to . So, is the usual graph, where the -faces are usually called vertices denoted by , and -faces are called the edges. We say is connected if the graph is connected.
We say a face is oriented if we assign an ordering of its vertices and write it as . Two ordering of the vertices of are said to determine the same orientation if there is an even permutation transforming one ordering into the other. If the permutation is odd, then the orientation are opposite. The -chain group of over , denoted by , is the vector space over generated by all oriented -faces of modulo the relation , where and are two different orientations of a same face. The cochain group is defined to be the dual of , i.e. , which are generated by the dual basis consisting of for all , where
The functions are called the elementary cochains. Note that , identified with , and , also can be identified with , where is the identify function on the empty simplex.
For each integer , The boundary map is defined to be
for each oriented -face of , where denotes the vertex has been omitted. In particular, for . We will have the augmented chain complex of :
satisfying .
Here, by abuse of notation, we use to denote the set of all -faces in the boundary of when . If and , then we define , namely, the sign of appeared in , and if .
The coboundary map is the conjugate of such that So
Similarly, we have the augmented cochain complex of :
satisfying . The -th reduced cohomology group for every is defined to be
By introducing inner products in and respectively, we have the adjoint of , which is defined by
for all .
Definition 2.1.
[21] The following three operators are defined on .
(1) The -dimensional combinatorial up Laplace operator or simply the -up Laplace operator:
(2) The -dimensional combinatorial down Laplace operator or the -down Laplace operator:
(3) The -dimensional combinatorial Laplace operator or the -Laplace operator:
Horak and Jost [20, 21] suggested to define an inner product on such that the elementary cochains are orthogonal to each other, which is equivalent to define a weight function on all faces of :
Then
In this paper, the weight is implicit from the context for the Laplace operator. If on all faces, then the underlying Laplacian is the combinatorial Laplace operator, denoted by , as discussed in [8, 14]. If the weights of all facets are equal to , and satisfies the normalizing condition:
for every which is not a facet of , then determines the normalized Laplace operator, denoted by , as analyzed in [21].
Horak and Jost [20, 21] give explicit formulas for and . Here we consider the matrix forms of the above operators. Let be the matrix of under the basis consisting of elementary cochains. We have
Let be the diagonal matrix consisting of the weight on . The matrix of satisfies
So
where and are diagonal matrices such that and . Hence
(2.1) |
2.2. Incidence-weighted and incidence-signed complex
Let be a complex, and let . If , then is an incidence of . We will introduce the weights of incidences of , which is different from the weights of faces for the definition of Laplace operators. We first consider a simple case: the weights of incidences are from .
Definition 2.2.
The incidence-signed complex is a pair , where is a complex, and such that if , and otherwise.
The signed boundary map is defined to be
The signed co-boundary map is the conjugate of , namely, for all ,
The signed adjoint is the adjoint of satisfying
for all .
Definition 2.3.
Let be a signed complex.
(1) The -up Laplace operator of is defined to be .
(2) The -down Laplace operator of is defined to be .
(3) The -Laplace operator of is defined to be .
Let be the matrix of under the basis consisting of elementary cochains. Then
The matrix of satisfies
where is a weight function on the faces of . So
Hence the matrix of is
(2.2) |
and the matrix of is
If , then and From this point of view, the signed complex is a generalization of the usual complex. If for all pairs with , then , which is a nonnegative matrix, where if . In this case, , and .
Let be the -th incidence matrix of with rows indexed by and columns indexed by , which is defined to be if , and otherwise. Then
We call the -up signless Laplace operator of , denoted by . Similarly, we have
which is called the -down signless Laplace operator of , denoted by .
Note that, if taking and both be identity matrix, then is called the signless Laplacian of a graph or the -skeleton of [19], which is studied in [6] for the nonbipartiteness of a graph, and surveyed in [5].
In general, let the underlying field of the chain group and the cochain group of be the complex field . We take the weight of each incidence of from
Definition 2.4.
The incidence-weighted complex is a pair , where is a simpicial complex, and such that if , and otherwise.
By a similar discussion, the weighted boundary map is defined to be
We will have the , the conjugate of , and , the adjoint of . Note that the inner product over is defined as
where, is a weight function on the faces of , denotes the conjugate of a complex number .
Definition 2.5.
Let be weighted simplical complex.
(1) The -up Laplace operator of is defined to be .
(2) The -down Laplace operator of is .
(3) The -Laplace operator of is .
The matrix of is
The matrix of satisfies
Hence the matrix of is
(2.3) |
and the matrix of is
where denotes the conjugate transpose of a complex matrix to avoid the confusion of used for the adjoint operator.
3. Covering complexes
Definition 3.1.
Let be two complexes. A simplical map from to is a map if whenever , then . We often use the notation .
Definition 3.2.
[28] Let be complexes. A pair is called a covering complex of if the following conditions hold.
(1) is a connected complex;
(2) is a simplicial map;
(3) for each , is a union of pairwise disjoint simplices, namely, such that is a bijection for each .
In Definition 3.2, the map is called a covering map, is called a covering complex of , and is called the underlying complex of the covering. By definition, for every . As noted by Horak and Jost [20], the covering complexes are an inaccurate discretization of covering spaces (continuous setting), since it does not contain a discrete analogue of the homeomorphic neighborhood requirement of covering topological spaces. They provide the definition of a strong covering, which accurately discretizes the notion of covering from the continuous setting.
Definition 3.3.
[21] A covering map is a strong covering if for every which is face of , then for each , there exists such that and .
Lemma 3.4.
Let be a strong covering. Then for every and every , there exists a bijection also denoted by such that
Proof.
Lemma 3.5.
[21] Let be a strong covering. There exists a constant such that for each and each ,
The quantity in Lemma 3.5 is called the degree of the covering, and is called a -fold covering of in this case.
Now we return to the graph coverings. Let be a simple graph. The vertex set of is denoted by and edge set is denoted by . The neighborhood of a vertex is denoted and defined by .
Definition 3.6.
Let and be simple graphs, where is connected. A surjective map is called a covering map if
(1) is a homomorphism, namely for each ,
(2) for each vertex and each vertex , is a bijection.
The above definition could be found in [1, 30]. The covering of a graph was is exactly the strong covering of the -skeleton of a complex if we require is connected. Gross and Tucker [16] established a relationship between -fold coverings and derived graphs. We need some preparation. Let be digraph possibly with multiple arcs, and let be the symmetric group on the set . Let which assigns a permutation to each arc of . The pair is called a permutation voltage digraph. A derived digraph associated with is a digraph with vertex set such that is an arc of if and only if and . For a simple graph , let denote the symmetric digraph obtained from by replacing each edge by two arcs with opposite directions, written as and respectively. Let be a permutation assignment of which holds that for each arc of . The derived digraph , simply written as , has symmetric arcs by definition, and is considered as a simple graph.
Lemma 3.7.
[16] Let be a connected graph and let be a -cover of . Then there exists an assignment of permutations in on such that is isomorphic to .
Remark 3.8.
Let be a complex. The -incidence graph is a bipartite graph with vertex set such that is an edge if and only if .
Lemma 3.9.
Let be a -fold covering. Then induces a -fold covering from to , and there exists a such that is isomorphic to by a map which sends to , to
Proof.
By the definition of strong covering, maps to , and to . So induces a surjective to map (also denoted by ) from the vertex set of to that of . If , then . So maps edges of to those of . By Lemma 3.4, for each and , is bijective. For each and , noting that and , is also bijective, as is bijective. So induces a -fold covering from to .
Example 3.10.
Let be the complexes in Fig. 3.1, where each triangle represents a -simplex. It is easy to see is a -fold covering of .

The -incidence graph and are listed in Fig. 3.2 and Fig. 3.3 respectively, where an edge is simply written as , and an face is written as .


Define a permutation assignment such that (see the blue edge in Fig. 3.2) and for all other incidences with . Then the derived graph is listed in Fig. 3.4, where a vertex or drawn with hollow circle represents the vertex or , and a vertex or drawn with solid circle represents the vertex or . It is easily seen there exists an isomorphism which sends to and to .

4. The spectrum of covering complex
Let be a -fold covering. Let with and . By Formula (3.5) in [21],
(4.1) |
where, if , then if is positively oriented, and otherwise.
By Lemma 3.9, is a -fold covering of , and there exists a permutation assignment on such that is isomorphic to via a map by sending to and to .
Recall that , where
for and . By the isomorphism , let and . We now use and to label the rows or columns of and corresponding to and respectively, that is,
(4.2) |
Note that , or equivalently if and only if , or equivalently and by the definition of derived graph.
Let be the diagonal matrix with rows indexed by such that
(4.4) |
and the diagonal matrix with rows indexed by such that
(4.5) |
Let be the matrix with rows indexed by and columns indexed by such that
(4.6) |
So by (4.2) and (4.3), we have
(4.7) |
We summarize the above the discussions into the following result.
Lemma 4.1.
Next we will give a decomposition of , where . Let
(4.8) |
the subgroup of generalized by the permutations assignment by . For each , define such that
(4.9) |
Then
(4.10) |
The permutation representation of maps each to a permutation matrix, namely
where if and else. So
(4.11) |
By the representation of symmetric group, let
be the decomposition of into the sum of irreducible sub-representation, where is the identity representation of degree one. So, there exists an invertible matrix such that for all ,
(4.12) |
where is the identity matrix of order corresponding to , and are the matrices corresponding to of respectively.
Theorem 4.2.
Proof.
Corollary 4.3.
[21] Let be a -fold covering map. Then
Proof.
Theorem 4.4.
Let be a -fold covering map. Suppose that for all . Then
where for such that , and such that is isomorphic to .
Proof.
By Lemma 3.9, there exists a permutation assignment such that is isomorphic to . Let be defined as in (4.8). As is connected, so is or . If , by definition is a union of two disjoint copies of , a contradiction. So, .
It is known has two irreducible representations, namely there exists an invertible matrix such that for each ,
where is called the sign representation. So, by Eq. (4.14), noting that ,
If we define a incidence-signed complex such that for , then the matrix of on is
So, by Eq. (2.2),
The result follows. ∎
Example 4.5.
Let be the complexes in Fig. 3.1. The spectrum of is
and the spectrum of is
where means as an eigenvalue with multiplicity .
By Example 3.10, letting such that and for all other incidences with , then is isomorphic to . Define a incidence-signed complex such that for each incidence with . So we have and for other incidences . The matrix of on is obtained from the matrix of on only by replacing the -entry by . The spectrum of is
So,
Finally, we consider the case when defined in (4.8) is an Abelian group.
Theorem 4.6.
Let be a -fold covering map, and let be the permutation assignment such that is isomorphic to . Suppose that for all . Let be the group defined in (4.8) which is an Abelian group. Then has exactly elements with the decomposition of irreducible sub-representations of degree one:
(4.15) |
and
where for such that .
Proof.
As is connected, so is or . By Theorem 3.4 of [29], is transitive on by the permutation action. If there exists and such that , then for any , as is transitive, for some . As is Abelian,
which implies that . So, faithfully acts on . By the orbit-stabilizer lemma, has the order of . As the irreducible representations of an Abelian group all have degree one, we get the decomposition (4.15) immediately. Also, there exists an invertible matrix such that
By (4.14), noting that are all of degree one, we have
Let for . Then is exactly the matrix of on the incidence-weighted complex . By Eq. (2.3), we have
The result now follows. ∎
A special case in Theorem 4.6 is , where is a cycle in . In this case, the irreducible representations of are easily obtained, namely, for , where .
By a similar discussion, we get the result on the -down Laplace operator of the covering complex. Let be a -fold covering. By Lemma 3.9, is a -fold covering of , and there exists a permutation assignment on such that is isomorphic to via a map by sending to and to . Suppose that for all . Let
(4.16) |
whose permutation representation has a decomposition
For each , define as in (4.9). Then there exists an invertible matrix such that
(4.17) |
where is defined as in (4.5).
Theorem 4.7.
Let be a -fold covering map. Then
Theorem 4.8.
Let be a -fold covering map. Suppose that for all . Then
where for such that , and such that is isomorphic to .
Theorem 4.9.
Let be a -fold covering map, let be the group defined in (4.16) which is an Abelian group. Suppose that for all . Then
where the permutation representation of has a decomposition , and for such that .
5. Cohomology group of covering complex
As proved by Eckmann [9] (also see [21]), the -th reduced cohomology group of a complex is equal to the kernel of the -Laplace operator , namely. In this section, we will investigate the relation between the homology group of a complex and that of its covering complex .
Lemma 5.1.
Let be a -fold covering map. Suppose that for each pair such that . Let and be such that for each
(5.1) |
Then the following results hold.
If , then .
If , then .
Proof.
(1) By the formula of the -up Laplace operator [21], if , then for each ,
(5.2) |
By Lemma 3.4, for every and each , there is a bijection also denoted by :
Similarly, there is a bijection:
So, by the assumption on weight and the notations , and ,
where the last equality follows from (5.2) and the second last equality follows from the signature relation (4.1). So .
(2) If , then for each ,
Theorem 5.2.
Let be a covering complex of a complex . Then
Proof.
By Eckmann’s result, it suffices to prove the can be embedded into as subspace. By Theorem 2.2 of [21], . Suppose that is a covering map. We choose weights on such that for each pair such that . This can easily be done by using combinatorial Laplace operator or normalized Laplace operator. By Lemma 5.1, for each , letting be defined as in (5.1). then .
Let . We will show that is subspace of with the same dimension as . Let be a basis of . Let be such that
For each , choosing an , we have
(5.3) |
So we have
which implies that as are linearly independent. So is a basis of . The result follows. ∎
Example 5.3.
Let be the complexes in Fig. 3.1. The -th betti number of is defined be the dimension of , denoted by . It is easy to see
Let be the graphs in Fig. 5.1. It is seen that is a -fold covering of , and
So it will be interesting to characterize the equality case of the inequality in Theorem 5.2.

References
- [1] A. Amit, N. Linial, Random graph coverings I: General theory and graph connectivity, Combinatorica, 22(1): 1–18, 2002.
- [2] Biggs, Algebraic Graph Theory, Cambridge Univ. Press, London, 1974.
- [3] Y. Bilu, N. Linial, Lifts, discrepancy and nearly optimal spectral gap, Combinatorica, 26(5): 495–519, 2006
- [4] O. Bottema, Über die Irrfahrt in einem Straßennetz, Math. Z., 39: 137–145, 1935.
- [5] D. Cvetković, P Rowlinson, S. K. Simić, Signless Laplacians of finite graphs, Linear Algebra Appl., 423: 155–171, 2007.
- [6] M. Desai, V. Rao, A characterization of the smallest eigenvalue of a graph, J. Graph Theory, 18: 181–194, 1994.
- [7] W. Dörfler, Double covers of hypergraphs and their properties, Ars Combinatoria, 6: 293-313, 1978.
- [8] A. M. Duval, V. Reiner, Shifted simplicial complexes are Laplacian integral, Trans. Amer. Math. Soc., 354(11): 4313–4344, 2002.
- [9] B. Eckmann, Harmonische Funktionen und Randwertaufgaben in einem Komplex, Comment. Math. Helv., 17 (1): 240–255, 1944.
- [10] F. Chung, Spectral Graph Theory, CBMS Regional Conference Series in Mathematics, No. 92, American Mathematical Society, 1997.
- [11] F. Chung, The Laplacian of a hypergraph, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pp. 21–36, 1993.
- [12] R. Q. Feng, J. H. Kwak, J. Lee, Characteristic polynomials of graph coverings, Bull. Aust. Math. Soc., 69: 133–136, 2004.
- [13] M. Fiedler, Algebraic connectivity of graphs, Czechoslovak Math. J., 23 (2): 298–305, 1973.
- [14] J. Friedman, Computing betti numbers via combinatorial Laplacians, Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 386–391, 1996
- [15] H. Garland, -adic curvature and the cohomology of discrete subgroups of p-adic groups, Ann. of Math., 97: 375–423, 1973.
- [16] J. L. Gross, T. W. Tucker, Generating all graph covering by permutation voltage assignments, Discrete Math., 18: 273-283, 1977.
- [17] R. Gustavson, Laplacians of covering complexes, Rose Hulman Undegrad. Math. J., 12(1):1–18, 2011.
- [18] G. Kirchhoff, Uber die Auflösung der Gleichungen, auf welche man bei der untersuchung der linearen verteilung galvanischer Ströme geführt wird, Ann. Phys. Chem., 72: 497–508, 1847.
- [19] W. Haemers, E. Spence, Enumeration of cospectral graphs, Europ. J. Combin., 25: 199–211, 2004.
- [20] D. Horak, J. Jost, Interlacing inequalities for eigenvalues of discrete Laplace operators, Ann. Global Anal. Geom., 43: 177–207, 2013.
- [21] D. Horak, J. Jost, Spectra of combinatorial Laplace operators on simplicial complexes, Adv. in Math., 244: 303–336, 2013.
- [22] D. Li, Y. Hou, Hypergraph coverings and their zeta functions, Electronic J. Combin., 25: #P4.59, 2018.
- [23] D. Li, Y. Hou, Laplacian of a graph covering and its applications, Bull. Malays. Math. Sci. Soc., 42: 2569–2583, 2019.
- [24] L. Lu, X. Peng, High-ordered random walks and generalized Laplacians on hypergraphs, Proc. Algorithms and Models for the Web-Graph, 2011.
- [25] W. Massey, Algebraic Topology: An Introduction, Springer-Verlag, New York, 1967
- [26] R. Merris, Laplacian matrices of graphs: a survey, Linear Algebra Appl., 197/198: 143-176, 1994.
- [27] H. Mizuno, I. Sato, Characteristic polynomials of some graph coverings, Discrete Math., 142: 295–298, 1995.
- [28] J. J. Rotman, Covering complexes with application to algebra, Rocky Mountain J. Math., 3: 641–674, 1973.
- [29] Y.-M. Song, Y.-Z. Fan, Y. Wang, M.-Y. Tian, J.-C. Wan, The spectral property of hypergraph covering, Discrete Math., 347, 113830, 2024.
- [30] H. M. Stark, A. A. Terras, Zeta functions of finite graphs and coverings, Adv. in Math., 121: 124-165, 1996.
- [31] C. Taszus, Higher order Laplace Beltrami spectra of networks, Master’s Thesis, Friedrich Schiller Universität Jena, 2010.