Related papers: Iwasawa theory for weighted graphs

We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph G is universal mixing if the instantaneous or average probability distribution of the quantum walk on G ranges over…

In this paper, we introduce a generalized concept of vertex transitivity in graphs called generalized vertex transitivity. We put forward a new invariant called transitivity number of a graph. The value of this invariant in different…

For any natural number $d$, a graph $G$ is a (disjoint) $d$-interval graph if it is the intersection graph of (disjoint) $d$-intervals, the union of $d$ (disjoint) intervals on the real line. Two important subclasses of $d$-interval graphs…

We prove a slight generalization of Iwasawa's `Riemann-Hurwitz' formula for number fields and use it to generalize Ferrero's and Kida's well-known computations of Iwasawa \lambda-invariants for the cyclotomic Z_2-extensions of imaginary…

We establish a new Iwasawa theory for the kernel of Frobenius on Jacobians of curves in geometric $\mathbf{Z}_p$-towers over the projective line in characteristic $p$, thereby proving several of the main conjectures of [arXiv:2107.12555].

Given a principal fibre bundle with structure group $S$, and a fibre transitive Lie group $G$ of automorphisms thereon, Wang's theorem identifies the invariant connections with certain linear maps $\psi\colon \mathfrak{g}\rightarrow…

Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$. In $1994$, Mahadev et al.~introduced a subclass of equistable graphs,…

Diverse facets Of the Theory of Quantum Walks on Graph are reviewed Till now .In specific, Quantum network routing, Quantum Walk Search Algorithm, Element distinctness associated to the eigenvalues of Graphs and the use of these relation…

Let $p>2$ be a prime. Under mild assumptions, we prove the Iwasawa main conjecture of Kato, for modular forms with general weight and conductor prime to $p$.

We consider geometric invariant theory for \emph{graded additive groups}, groups of the form $\mathbb{G}_a^r\rtimes_w\mathbb{G}_m$ such that the $\mathbb{G}_m$-action on $\mathbb{G}_a^r$ is a scalar multiplication with weight…

We establish a generalized Ihara zeta function formula for simple graphs with bounded degree. This is a generalization of the formula obtained by G. Chinta, J. Jorgenson and A. Karlsson from a vertex-transitive graph.

The exponential family of random graphs represents an important and challenging class of network models. Despite their flexibility, conventionally used exponential random graphs have one shortcoming. They cannot directly model weighted…

We begin a systematic investigation of universal norms for $p$-adic representations in higher rank Iwasawa theory. After establishing the basic properties of the module of higher rank universal norms we construct an Iwasawa-theoretic…

We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…

We propose a natural, parameter-free, discrete-variable formulation of Feynman path integrals. We show that for discrete-variable quantum systems, Feynman path integrals take the form of walks on the graph whose weighted adjacency matrix is…

We develop a theory of graph C*-algebras using path groupoids and inverse semigroups. Row finiteness is not assumed so that the theory applies to graphs for which there are vertices emitting a countably infinite set of edges. We show that…

This paper proposes a family of permutation-invariant graph embeddings, generalizing the Skew Spectrum of graphs of Kondor & Borgwardt (2008). Grounded in group theory and harmonic analysis, our method introduces a new class of graph…

We use simple iterated one-loop graphs in massless Yukawa theory and QED to pose the following question: what are the symmetries of the residues of a graph under a permutation of places to insert subdivergences. The investigation confirms…

We develop an equivariant theory of graphs with respect to quantum symmetries and present a detailed exposition of various examples. We portray unitary tensor categories as a unifying framework encompassing all finite classical simple…

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…