English

First order approach and index theorems for discrete and metric graphs

Spectral Theory 2007-09-03 v2 Mathematical Physics Combinatorics Functional Analysis math.MP

Abstract

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 \Cd\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.

Keywords

Cite

@article{arxiv.0708.3707,
  title  = {First order approach and index theorems for discrete and metric graphs},
  author = {Olaf Post},
  journal= {arXiv preprint arXiv:0708.3707},
  year   = {2007}
}

Comments

36 pages, some references added