DOI: 10.2969/aspm/01510211
|View full text |Cite
|
Sign up to set email alerts
|

Zeta Functions of Finite Graphs and Representations of $p$-Adic Groups

Abstract: Dedicated to Prof. Friedrich Hirzehruch and Prof. lchiro Satake on their sixtieth birthdaysGraphs and multigraphs § 2. Zeta functions of finite graphs § 3. Spectrum of a finite multigraph § 4. Harmonic functions and the Hodge decomposition § 5. Representations of C[Ti, T2]; a proof of (3.14) § 6. Representations of p-adic groups § 7. Special values of Zx(u) § 8. Miscellaneous results § 9. Computations of Zx(u) for well known families of X § 10. Examples: list of graphs for n<6, m<1. § 11. References § 0. Intro… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

4
148
0
1

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 195 publications
(153 citation statements)
references
References 15 publications
4
148
0
1
Order By: Relevance
“…Hashimoto introduced the matrix B in the context of the Ihara zeta function [12]. We have the identity…”
Section: Ihara Zeta Functionmentioning
confidence: 99%
See 1 more Smart Citation
“…Hashimoto introduced the matrix B in the context of the Ihara zeta function [12]. We have the identity…”
Section: Ihara Zeta Functionmentioning
confidence: 99%
“…It is indexed by the set E = {(u, v) : {u, v} ∈ E} of oriented edges in E and defined by B ef = 1 I(e 2 = f 1 )1 I(e 1 = f 2 ) = 1 I(e 2 = f 1 )1 I(e = f −1 ), where for any e = (u, v) ∈ E, we set e 1 = u, e 2 = v, e −1 = (v, u). This matrix was introduced by Hashimoto [12]. A non-backtracking walk is a directed path of directed edges of G such that no edge is the inverse of its preceding edge.…”
Section: Introductionmentioning
confidence: 99%
“…This operator is represented by a 2m × 2m-matrix A, whose entries are in {0, 1}. The operator T was considered by Hashimoto [13] and Bass [2] in connection with their study of the Ihara zeta function of a graph (see also: Stark and Terras [21]). Although not strictly necessary for the main argument of this paper, we will comment upon this relation in 2.12 below.…”
Section: T (E) := T(e)=o(e )mentioning
confidence: 99%
“…The operator T was considered by Hashimoto [13] and Bass [2] in connection with their study of the Ihara zeta function of a graph (see also: Stark and Terras [21]). …”
mentioning
confidence: 99%
“…Supposons E connexe, et soit E son revêtement universel, relativement a un point-base x ∈ som E. Le graphe E est un arbre régulier de valence q + 1, et l'on peutécrire E sous la forme E/Γ E , où Γ E = π 1 (E, x) est un sous-groupe discret sans torsion de Aut( E). Les définitions ci-dessus (ainsi que celles données plus loin) peuvent se traduire en termes de Γ E ; c'est le point de vue de Ihara [14]; voir aussi [11] et [16].…”
Section: Nombres De Circuitsunclassified