English

Iwasawa theory for vertex-weighted graphs

Combinatorics 2025-05-20 v1 Number Theory

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\`{e}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 Kida's formula for Zpd\mathbb{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 Zpd\mathbb{Z}_p^d-towers. We also provide several numerical examples.

Cite

@article{arxiv.2505.12351,
  title  = {Iwasawa theory for vertex-weighted graphs},
  author = {Ryosuke Murooka and Sohei Tateno},
  journal= {arXiv preprint arXiv:2505.12351},
  year   = {2025}
}

Comments

29 pages, 8 figures

R2 v1 2026-07-01T02:19:31.439Z