Iwasawa theory for weighted graphs

Abstract

Let p be a prime number and let d be a positive integer. In this paper, we generalize Iwasawa theory for graphs initiated by Gonet and Valli\`eres to weighted graphs. In particular, we prove an analogue of Iwasawa's class number formula and that of Kida's formula for compatible systems of (Z/pnZ)d-covers of weighted graphs. We also provide numerical examples of characteristic elements and Iwasawa invariants. At the end of this paper, we give an application of the ideas of Iwasawa theory to the theory of discrete-time quantum walks in graphs.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…