Iwasawa theory for vertex-weighted graphs
Ryosuke Murooka, Sohei Tateno
Source record
Source: Crossref
Published: Aug 4, 2026
DOI: 10.1007/s10801-026-01577-w
Open original source ↗Source abstract
Abstract Chung-Langlands established a matrix-tree theorem for positive real-valued vertex-weighted graphs, and Wu-Feng-Sato developed a theory of Ihara zeta functions for those graphs. In this paper, generalizing and refining these previous works, we initiate the Iwasawa theory for vertex-weighted graphs, which is a generalization of the Iwasawa theory for graphs initiated by Gonet and Vallières independently. First, we generalize the matrix-tree theorem by Chung-Langlands to arbitrary field-valued vertex-weighted graphs. Second, we refine and prove the so-called decomposition formula for vertex-weighted graphs and edge-weighted graphs without any assumption. Applying these results, we prove the Iwasawa-type formula and a refinement of Kida’s formula for Z p d -towers of vertex-weighted graphs. Our refinement of the decomposition formulas allows us to estimate the root-wise growth of weighted complexities in Z p d -towers. We also provide several numerical examples.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.