``Combinatorial Proofs of Bass's Evaluation of the Ihara-Selberg Zeta function for a Graph'' by Dominique Foata and Doron Zeilberger

(Appeared in Trans. Amer. Math. Soc. 351 (1999), 2257--2274. )

Written: Dec. 1, 1996.

Combinatorics has come a long way since H.C. Whitehead (1904-1960) had called graph theory `the slum of topology' and Jean Dieudonn\'e had disdainfully enclosed {\it combinatorics} in quotation marks stating that ``many problems arising in `combinatorics' are {\it without issue}.'' (A Panorama of Pure Mathematics, Academic Press, 1982, p.2).

What could be a better proof that the tables have turned than the fact that the two persons that come right after Whitehead in Dieudonn\'e's list of the originators of K-theory (ibid, p. 180), Jean-Pierre Serre and Hyman Bass, don't hesitate to use trees and graph theory in their own works.

In this paper, Dominique Foata and I give purely combinatorial proofs of Bass's evaluations of the the Ihara-Selberg Zeta function for a graph. This work took us longer than expected, and an intriguing connections to the Amitsur identity surfaced, thanks to a remark of Jouanolou.

This paper is dedicated to our good master, Gian-Carlo Rota, on his millionth (in base 2) birthday. Without his teachings neither Bass's paper, nor this one, would have been possible.

.tex version

.dvi version (for previewing)

.ps version

.pdf version


Added Dec. 8, 1998: One of the results in the present article found a very interesting application in Knot Theory.


Back to Doron Zeilberger's List of Papers

Back to Doron Zeilberger's Home Page