2022
DOI: 10.1007/s40316-022-00194-w
|View full text |Cite
|
Sign up to set email alerts
|

On abelian $$\ell $$-towers of multigraphs III

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
7
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(15 citation statements)
references
References 16 publications
0
7
0
Order By: Relevance
“…It is shown by McGown and the fourth named author (cf. [19], [20], [26]) that there are invariants and such that for . This establishes an analog of Iwasawa’s formula (1.1) in the setting of multigraphs.…”
Section: Introductionmentioning
confidence: 62%
See 2 more Smart Citations
“…It is shown by McGown and the fourth named author (cf. [19], [20], [26]) that there are invariants and such that for . This establishes an analog of Iwasawa’s formula (1.1) in the setting of multigraphs.…”
Section: Introductionmentioning
confidence: 62%
“…18.15] for the Artin–Ihara L -function gives where is the twisted adjacency matrix of Definition 2.9, D is the valency matrix of X , and is the Euler characteristic of X . From now on, we let Coming back to the abelian -tower associated with , for all positive integer n , [20, Cor. 5.6] implies where is the character of satisfying .…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…it can again be described completely in terms of some invariants µ, λ and ν attached to the Z p -cover X ∞ /X. The proof of this result, which was given in increasing generality in a series of papers of Vallières and McGown (see [37,25,26]), was completely analytic, in the sense that it was based on a direct relation of the number of spanning trees to certain special values of Artin-Ihara L-functions, which can be computed explicitly in this setting. In [8] the above approach was generalised to Z l p -covers of graphs.…”
Section: Introductionmentioning
confidence: 90%
“…More recently, an analogous result was proven in the context of graph theory where field extensions are replaced with graph covers and the class number is replaced with the number of spanning trees. See [3,4,12,13,29].…”
Section: Introductionmentioning
confidence: 99%