A trace on fractal graphs and the Ihara zeta function

Mathematics – Operator Algebras

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

30 pages, 5 figures. v3: minor corrections, to appear on Transactions AMS

Scientific paper

10.1090/S0002-9947-08-04702-8

Starting with Ihara's work in 1968, there has been a growing interest in the study of zeta functions of finite graphs, by Sunada, Hashimoto, Bass, Stark and Terras, Mizuno and Sato, to name just a few authors. Then, Clair and Mokhtari-Sharghi have studied zeta functions for infinite graphs acted upon by a discrete group of automorphisms. The main formula in all these treatments establishes a connection between the zeta function, originally defined as an infinite product, and the Laplacian of the graph. In this article, we consider a different class of infinite graphs. They are fractal graphs, i.e. they enjoy a self-similarity property. We define a zeta function for these graphs and, using the machinery of operator algebras, we prove a determinant formula, which relates the zeta function with the Laplacian of the graph. We also prove functional equations, and a formula which allows approximation of the zeta function by the zeta functions of finite subgraphs.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A trace on fractal graphs and the Ihara zeta function 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 trace on fractal graphs and the Ihara zeta function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A trace on fractal graphs and the Ihara zeta function will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-265091

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.