Combinatorial Laplacians for Complex Pairs
- Combinatorial Laplacians for complex pairs are discrete Hodge-type operators defined on chain groups of pairs, generalizing classical Laplacians to capture relative homology.
- They extend absolute simplicial Laplacians by incorporating relative and persistent formulations that analyze spectral invariants, stability, and topological features.
- Recent advances embed these operators in a Hilbert complex framework, clarifying spectral gaps, stability conditions, and providing matrix-tree theorem generalizations.
Searching arXiv for the most relevant papers on combinatorial Laplacians for complex pairs and related generalized/relative formulations. arXiv search: (Zhan et al., 22 Jul 2025) combinatorial Laplacians relative homology complex pairs. Combinatorial Laplacians for complex pairs are discrete Hodge-type operators attached not only to a single simplicial or cellular complex, but also to data such as a simplicial pair , an inclusion , a primal–dual pair , or a complex with a distinguished boundary subcomplex. In the relative simplicial setting, the operator acts on relative chain groups and detects relative homology ; in persistent settings, the operator is instead built on and uses ambient -chains in whose boundary returns to . Recent work places these constructions in a broader Hilbert-complex framework and clarifies which spectral features are topological, which are boundary-condition dependent, and which fail to be monotone or stable for pairs (Zhan et al., 22 Jul 2025, Wolf et al., 24 Sep 2025).
1. Absolute simplicial Laplacians as the base model
For a finite simplicial complex , the standard chain groups are
0
with boundary maps
1
when 2 is obtained by deleting the 3-th vertex of 4. After choosing inner products on chain groups, one obtains adjoints 5, and the combinatorial Hodge Laplacian is
6
Its kernel recovers simplicial homology: 7 This is the discrete model that later pair constructions generalize (Wolf et al., 24 Sep 2025).
The same structure can be written on cochains. In the weighted simplicial framework, one introduces coboundaries 8, adjoints 9, and the up-, down-, and full Laplacians
0
These operators are self-adjoint and non-negative, and their kernel is identified with reduced cohomology by the discrete Hodge theorem (Horak et al., 2011).
This absolute theory already contains the algebraic pattern that persists for pairs: an upper term coming from adjacent higher-dimensional cells, a lower term coming from adjacent lower-dimensional cells, and a harmonic kernel representing a topological quotient.
2. Relative Laplacians on simplicial complex pairs
For a simplicial pair 1, with 2 a subcomplex, the basic object is the relative chain group
3
The paper "Combinatorial Laplacians and relative Homology of complex pairs" (Zhan et al., 22 Jul 2025) identifies this canonically with the free 4-module on simplices of 5 in degree 6: 7 Under this identification, the relative boundary map is
8
Relative boundaries are therefore obtained from ordinary simplicial boundaries by discarding those faces that lie in 9.
Over 0, the basis 1 is declared orthonormal. The adjoint of the relative boundary is the relative coboundary
2
The 3-dimensional relative Laplacian is then
4
Its two summands are the up-down and down-up Laplacians,
5
The entrywise formulas make the effect of the subcomplex 6 explicit. For 7,
8
and
9
The diagonal term of the lower part is reduced from 0 to the number of codimension-one faces not in 1, and off-diagonal terms depend on whether the common 2-face lies inside or outside 3. In the graph case, 4 is exactly a Dirichlet Laplacian on vertices not in 5 (Zhan et al., 22 Jul 2025).
3. Relative Hodge theory, spectral gaps, and matrix-tree theorems
The central topological statement for relative simplicial Laplacians is the relative Hodge theorem: 6 Equivalently,
7
Thus the smallest eigenvalue
8
satisfies
9
This makes relative Laplacians a spectral model for relative topology, exactly as ordinary combinatorial Laplacians model ordinary homology (Zhan et al., 22 Jul 2025).
The same work develops a relative matrix-tree theorem. For a pair 0, one defines 1-dimensional relative spanning forests and relative spanning trees by homological conditions on subcomplexes 2 with 3. If 4, then the product of all nonzero eigenvalues of 5 is expressed as a weighted sum over relative spanning trees and relative spanning forests: 6 This generalizes both the Duval–Klivans–Martin higher-dimensional matrix-tree theorem and Chung’s result for graph pairs (Zhan et al., 22 Jul 2025).
The same paper proves lower bounds for the relative spectral gap. If 7 is a 8-th discrete boundary, then
9
where 0 is the associated subcomplex, 1 is the maximum dimension of a missing face of 2, and 3. For flag complex pairs, one obtains
4
These bounds yield sufficient conditions for 5. A further comparison theorem relates 6 to the ordinary gap 7, showing that sufficiently large ambient spectral gap forces vanishing of relative homology (Zhan et al., 22 Jul 2025).
4. Persistent Laplacians: pair operators that are not relative Laplacians
A distinct construction arises for inclusions 8. The persistent combinatorial Laplacian is not the Laplacian of the relative complex 9. Instead, it is built on 0, but uses ambient 1-chains in 2 whose boundary lands in 3: 4 The persistent Laplacian is
5
Its kernel gives image-persistent homology
6
in finite dimensions, and more generally under a closed-range hypothesis (Wolf et al., 24 Sep 2025).
The paper "Persistent Laplacians: properties, algorithms and implications" (Mémoli et al., 2020) proves the persistent analogue of the Hodge theorem: 7 and shows that the persistent up-Laplacian is a Schur complement of the ordinary up-Laplacian on 8. This gives an explicit linear-algebraic interpretation of the pair operator as elimination of simplices outside 9.
The later generalization "Generalized Persistent Laplacians and their Spectral Properties" (Wolf et al., 24 Sep 2025) embeds this construction into a Hilbert-complex framework. For an inclusion 0 of Hilbert complexes, the auxiliary space is
1
and the persistent Laplacians are defined by quadratic forms with formal expressions
2
A central clarification is that the full persistent Laplacian is generally not monotone or stable, even for finite simplicial complexes. By contrast, the up- and down-persistent Laplacians are monotone under nested inclusions and stable under interleaving distance. Moreover, their nonzero spectra determine the nonzero spectrum of the full operator. This corrects a common misconception: the spectrally well-behaved objects for inclusions are the separated up and down parts, not the full persistent Laplacian as a standalone invariant (Wolf et al., 24 Sep 2025).
5. Operator-theoretic generalizations and infinite-dimensional settings
The generalized theory replaces finite chain groups by Hilbert spaces and ordinary differentials by densely defined closed operators. A Hilbert complex is
3
where each 4 is a Hilbert space and each
5
is densely defined and closed, with
6
This setup allows self-adjoint Laplacians to be defined through quadratic forms even when the naïve operator sum
7
is problematic on domain intersections (Wolf et al., 24 Sep 2025).
For a Hilbert complex, the up-, down-, and full Laplacians are induced by
8
and
9
The kernel satisfies
0
and the generalized Hodge theorem gives
1
When images are closed, this reduces to ordinary homology (Wolf et al., 24 Sep 2025).
A related operator-theoretic development studies Hodge Laplacians on general countable weighted simplicial complexes and distinguishes Dirichlet and Neumann realizations via quadratic forms. It defines
2
with corresponding self-adjoint operators 3 and 4, 5. The paper does not explicitly formulate a theory of pairs 6, but it treats Dirichlet and Neumann domains as discrete analogues of 7 and 8. This suggests an operator-theoretic route to pair Laplacians through closed form domains rather than purely finite-dimensional matrix formulas (Bartmann et al., 11 Aug 2025).
6. Other pair formalisms: primal–dual pairs, boundary-value pairs, and cellular pairs
A different notion of complex pair appears in discrete exterior calculus on a primal complex 9 together with its combinatorial dual 00. In that setting, the Laplacian depends intrinsically on both complexes because 01 is defined from incidence and 02 from the Hodge star associated with the primal–dual correspondence. For dual scalar fields 03, the operator is
04
a weighted nearest-neighbor Laplacian on the dual 05-skeleton. The construction is therefore a Laplacian for the pair 06, not for a single incidence structure alone (Calcagni et al., 2012).
For complexes with boundary, a boundary-value formulation uses a pair 07 where 08 is a boundary subcomplex. In that setting, one considers the relative cochain complex
09
and the corresponding Laplacian 10. In degree zero this is a discrete Dirichlet Laplacian. The same formalism yields a combinatorial Dirichlet-to-Neumann operator from the quadratic form of the discrete Dirichlet problem and leads to a gluing formula for determinants of combinatorial Laplacians under boundary identification (Reshetikhin et al., 2014).
In higher-dimensional cell complexes, the pair viewpoint appears through relative interpretations of Laplacian minors. For a finite CW complex, the combinatorial Laplacian on 11-chains is
12
The higher-dimensional Kirchhoff-type formulas express coefficients of its characteristic polynomial by sums over forests and spanning coforests, and the relevant minors are identified with boundary maps of pairs
13
so that
14
The paper does not formulate a full standalone theory of relative Laplacians for 15, but its matrix-tree formulas are already organized around pair homology groups (Cappell et al., 2015).
7. Conceptual distinctions and common confusions
Several non-equivalent constructions are called “Laplacians for pairs,” and the distinctions are substantive rather than terminological.
| Construction | State space | Topological or spectral target |
|---|---|---|
| Relative simplicial Laplacian | 16 | 17 |
| Persistent Laplacian | 18 with ambient 19-chains | 20 |
| Primal–dual DEC Laplacian | 21 cochains/forms | Hodge operator on a primal–dual pair |
| Dirichlet pair Laplacian | 22 | Boundary-value problem and DN operator |
The first misconception is to identify persistent Laplacians with relative Laplacians. The generalized persistent theory states explicitly that the persistent Laplacian for 23 is not a Laplacian on the quotient complex 24, nor simply the relative complex 25; it is a Laplacian on 26 whose upper part is induced from ambient chains in 27 whose boundary returns to 28 (Wolf et al., 24 Sep 2025).
The second misconception is to treat all pair Laplacians as equally robust spectral invariants. Relative Laplacians on 29 inherit the ordinary Hodge paradigm directly, while full persistent Laplacians fail monotonicity and general stability. In the persistent setting, the robust objects are the up- and down-persistent pieces, whose spectra nevertheless determine the nonzero spectrum of the full operator (Wolf et al., 24 Sep 2025).
The third misconception is that pair Laplacians are necessarily quotient-based. The primal–dual DEC Laplacian is pair-based in a different sense: it uses two coupled complexes 30 and 31. Boundary-value and gluing formalisms likewise use a pair 32, but the operator is organized by vanishing conditions, normal components, and Dirichlet-to-Neumann maps rather than by relative chain quotients (Calcagni et al., 2012, Reshetikhin et al., 2014).
Taken together, these constructions show that “combinatorial Laplacians for complex pairs” is not a single theory but a family of related Hodge-type frameworks. The relative simplicial Laplacian of 33 is the direct discrete model for relative homology; persistent Laplacians encode image persistence for inclusions; primal–dual Laplacians couple a complex to its dual; and Dirichlet pair Laplacians encode boundary-value problems and gluing. The recent literature makes these differences explicit and, in the relative and generalized persistent settings, connects them to precise spectral, homological, and enumerative statements (Zhan et al., 22 Jul 2025, Wolf et al., 24 Sep 2025).