A Combinatorial Proof of Bass's Evaluations of the Ihara-Selberg Zeta Function for Graphs
英文摘要:
We derive combinatorial proofs of the main two evaluations of the Ihara-Selberg Zeta function associated with a graph. We give three proofs of the first evaluation all based on the algebra of Lyndon words. In the third proof it is shown that the first evaluation is an immediate consequence of Amitsur's identity on the characteristic polynomial of a sum of matrices. The second evaluation of the Ihara-Selberg Zeta function is first derived by means of a sign-changing involution technique. Our second approach makes use of a short matrix-algebra argument.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。