The surjectivity of the combinatorial Laplacian on infinite graphs
classification
🧮 math.AP
math.CO
keywords
combinatorialdeltainfinitelaplaciancolonconnecteddefinedfinite
read the original abstract
Given a connected locally finite simplicial graph $ G$ with vertex set $V$, the combinatorial Laplacian $\Delta_G \colon \R^V \to \R^V$ is defined on the space of all real-valued functions on $V$. We prove that $\Delta_G$ is surjective if $G$ is infinite.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.