Related papers: Iwasawa theory for vertex-weighted graphs

We introduce a generalized Bartholdi zeta function for simple graphs with bounded degree. This zeta function is a generalization of both the Bartholdi zeta function which was introduced by L.~Bartholdi and the Ihara zeta function which was…

We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give…

We introduce and study the weighted $r$-path ideal of a weighted graph $G_\omega$, which is a common generalization of Conca and De Negri's $r$-path ideal for unweighted graphs and Paulsen and Sather-Wagstaff's edge ideal of the weighted…

Let $l$ and $p$ be two distinct prime numbers. We study $l$-isogeny graphs of ordinary elliptic curves defined over a finite field of characteristic $p$, together with a level structure. Firstly, we show that as the level varies over all…

We present an elementary proof of a generalization of Kirchoff's matrix tree theorem to directed, weighted graphs. The proof is based on a specific factorization of the Laplacian matrices associated to the graphs, which only involves the…

Wu, Zhang and Li [4] conjectured that the set of vertices of any simple graph $G$ can be equitably partitioned into $\lceil(\Delta(G)+1)/2\rceil$ subsets so that each of them induces a forest of $G$. In this note, we prove this conjecture…

We present a general framework to generate trees every vertex of which has a non-negative weight and a color. The colors are used to impose certain restrictions on the weight and colors of other vertices. We first extend the enumeration…

We present time-efficient distributed algorithms for decomposing graphs with large edge or vertex connectivity into multiple spanning or dominating trees, respectively. As their primary applications, these decompositions allow us to achieve…

Let $p$ and $\ell$ be prime numbers, and $d\ge1$ an integer. We formulate and prove Iwasawa main conjectures of the Picard groups and Bowen--Franks groups in $\mathbb{Z}_p^d$-towers of digraphs. In particular, we relate the $\ell$ parts of…

Let $W$ be a finite Coxeter group and $\Omega$ be its $W$-graph algebra as defined by Gyoja. The author's previous paper \cite{hahn2016wgraphs} considered this algebra in some detail, proposed, and proved in some small cases the $W$-graph…

We put forward the concept of measure graphs. These are (possibly uncountable) graphs equipped with an action of a groupoid and a measure invariant under this action. Examples include finite graphs, periodic graphs, graphings and…

Let $(W,S)$ be a finite Coxeter group. Kazhdan and Lusztig introduced the concept of $W$-graphs and Gyoja proved that every irreducible representation of the Iwahori-Hecke algebra $H(W,S)$ can be realized as a $W$-graph. Gyoja defined an…

A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…

For $\Gamma=\mathbb{Z}_p$, Iwasawa was the first to construct $\Gamma$-extensions over number fields with arbitrarily large $\mu$-invariants. In this work, we investigate other uniform pro-$p$ groups which are realizable as Galois groups of…

The Jacobian is an algebraic invariant of a graph which is often seen in analogy to the class group of a number field. In particular, there have been multiple investigations into the Iwasawa theory of graphs with the Jacobian playing the…

A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…

Graph decompositions are the natural generalisation of tree decompositions where the decomposition tree is replaced by a genuine graph. Recently they found theoretical applications in the theory of sparsity, topological graph theory,…

We derive two formulas for the weighted sums of rooted spanning forests of particular sequence of graphs by using the matrix tree theorem. We consider cycle graphs with edges so called the pendant edges. One of our formula can be described…

In this paper, we study graph-theoretic analogies of the Mertens' theorems by using basic properties of the Ihara zeta-function. One of our results is a refinement of a special case of the dynamical system Mertens' second theorem due to…

In 2020, Alexander Grigor'yan, Yong Lin and Shing-Tung Yau [4] introduced the Reidemeister torsion and the analytic torsion for digraphs by means of the path complex and the path homology theory. Based on the analytic torsion for digraphs…