A lower bound for nodal count on discrete and metric graphs

Details A lower bound for nodal count on discrete and metric graphs A lower bound for nodal count on discrete and metric graphs

2006-11-13

arxiv.org/abs/math-ph/0611026v4

Commun. Math. Phys., 278, 803-819 (2008)

Physics

Mathematical Physics

15 pages, 4 figures; Minor corrections: added 2 important references

Scientific paper

10.1007/s00220-007-0391-3

According to a well-know theorem by Sturm, a vibrating string is divided into exactly N nodal intervals by zeros of its N-th eigenfunction. Courant showed that one half of Sturm's theorem for the strings applies to the theory of membranes: N-th eigenfunction cannot have more than N domains. He also gave an example of a eigenfunction high in the spectrum with a minimal number of nodal domains, thus excluding the existence of a non-trivial lower bound. An analogue of Sturm's result for discretizations of the interval was discussed by Gantmacher and Krein. The discretization of an interval is a graph of a simple form, a chain-graph. But what can be said about more complicated graphs? It has been known since the early 90s that the nodal count for a generic eigenfunction of the Schrodinger operator on quantum trees (where each edge is identified with an interval of the real line and some matching conditions are enforced on the vertices) is exact too: zeros of the N-th eigenfunction divide the tree into exactly N subtrees. We discuss two extensions of this result in two directions. One deals with the same continuous Schrodinger operator but on general graphs (i.e. non-trees) and another deals with discrete Schrodinger operator on combinatorial graphs (both trees and non-trees). The result that we derive applies to both types of graphs: the number of nodal domains of the N-th eigenfunction is bounded below by N-L, where L is the number of links that distinguish the graph from a tree (defined as the dimension of the cycle space or the rank of the fundamental group of the graph). We also show that if it the genericity condition is dropped, the nodal count can fall arbitrarily far below the number of the corresponding eigenfunction.

Affiliated with

Also associated with

No associations

Rating

A lower bound for nodal count on discrete and metric graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A lower bound for nodal count on discrete and metric graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A lower bound for nodal count on discrete and metric graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-669656