First order approach and index theorems for discrete and metric graphs

Details First order approach and index theorems for discrete and metric graphs First order approach and index theorems for discrete and metric graphs

2007-08-28

arxiv.org/abs/0708.3707v2

Mathematics

Spectral Theory

36 pages, some references added

Scientific paper

The aim of the present paper is to introduce the notion of first order (supersymmetric) Dirac operators on discrete and metric (``quantum'') graphs. In order to cover all self-adjoint boundary conditions for the associated metric graph Laplacian, we develop systematically a new type of discrete graph operators acting on a decorated graph. The decoration at each vertex of degree-d is given by a subspace of $\C^d$, generalising the fact that a function on the standard vertex space has only a scalar value. We develop the notion of exterior derivative, differential forms, Dirac and Laplace operators in the discrete and metric case, using a supersymmetric framework. We calculate the (supersymmetric) index of the discrete Dirac operator generalising the standard index formula involving the Euler characteristic of a graph. Finally, we show that the corresponding index for the metric Dirac operator agrees with the discrete one.

Affiliated with

Also associated with

No associations

Rating

First order approach and index theorems for 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 First order approach and index theorems for discrete and metric graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and First order approach and index theorems for discrete and metric graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-362808