Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Decomposition of the Laplacian on Metric Graphs

Published 2 Jan 2019 in math.SP, math-ph, and math.MP | (1901.00349v4)

Abstract: We study the Laplacian on family preserving metric graphs. These are graphs that have a certain symmetry that, as we show, allows for a decomposition into a direct sum of one-dimensional operators whose properties are explicitly related to the structure of the graph. Such decompositions have been extremely useful in the study of Schr\"odinger operators on metric trees. We show that the tree structure is not essential, and moreover, obtain a direct and simple correspondence between such decompositions in the discrete and continuum case.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.