The surjectivity of the combinatorial Laplacian on infinite graphs
Abstract
Given a connected locally finite simplicial graph G with vertex set V, the combinatorial Laplacian G V V is defined on the space of all real-valued functions on V. We prove that G is surjective if G is infinite.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.