2000 character limit reached
Neumann Domains on Graphs and Manifolds (1805.07612v1)
Published 19 May 2018 in math.SP, math-ph, and math.MP
Abstract: The nodal set of a Laplacian eigenfunction forms a partition of the underlying manifold or graph. Another natural partition is based on the gradient vector field of the eigenfunction (on a manifold) or on the extremal points of the eigenfunction (on a graph). The submanifolds (or subgraphs) of this partition are called Neumann domains. This paper reviews the subject, as appears in a few recent works and points out some open questions and conjectures. The paper concerns both manifolds and metric graphs and the exposition allows for a comparison between the results obtained for each of them.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.