Pith. sign in

The hydrogen identity for Laplacians

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

For any finite simple graph G, the hydrogen identity H=L-L^(-1) holds, where H=(d+d^*)^2 is the sign-less Hodge Laplacian defined by sign-less incidence matrix d and where L is the connection Laplacian. Any spectral information about L directly leads to estimates for the Hodge Laplacian H=(d+d^*)^2 and allows to estimate the spectrum of the Kirchhoff Laplacian H_0=d^* d. The hydrogen identity implies that the random walk u(n) = L^n u with integer n solves the one-dimensional Jacobi equation Delta u=H^2 with (Delta u)(n)=u(n+2)-2 u(n)+u(n-2). Every solution is represented by such a reversible path integral. Over a finite field, we get a reversible cellular automaton. By taking products of complexes such processes can be defined over any lattice Z^r. Since L^2 and L^(-2) are isospectral, by a theorem of Kirby, the matrix L^2 is always similar to a symplectic matrix if the graph has an even number of simplices. The hydrogen relation is robust: any Schr\"odinger operator K close to H with the same support can still can be written as $K=L-L^{-1}$ where both L(x,y) and L^-1(x,y) are zero if x and y do not intersect.

citation-role summary

background 1

citation-polarity summary

fields

math.CO 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

Remarks on the Brouwer Conjecture

math.CO · 2025-08-11 · conditional · novelty 7.0

The Brouwer spectral conjecture holds for all connected graphs whose vertex count is at least 4 times the square of the maximum degree; the ordinary-graph case also implies the loop/multigraph case.

citing papers explorer

Showing 1 of 1 citing paper.

  • Remarks on the Brouwer Conjecture math.CO · 2025-08-11 · conditional · none · ref 16 · internal anchor

    The Brouwer spectral conjecture holds for all connected graphs whose vertex count is at least 4 times the square of the maximum degree; the ordinary-graph case also implies the loop/multigraph case.