Related papers: Kida's formula for graphs with ramifications

Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning…

We find closed form formulas for Kemeny's constant and its relationship with two Kirchhoffian indices for some composite graphs that use as basic building block a graph endowed with one of several symmetry properties.

We give several formulas for how Iwasawa $\mu$-invariants of abelian varieties over unramified $\mathbb{Z}_{p}$-extensions of function fields change under isogeny. These are analogues of Schneider's formula in the number field setting. We…

In this paper, we consider double ramification cycles with orbifold targets. An explicit formula for double ramification cycles with orbifold targets, which is parallel to and generalizes the one known for the smooth case, is provided. Some…

Arborified multiple zeta values are a generalization of multiple zeta values associated with rooted trees. There are two types of decorated rooted trees, corresponding respectively to the series and the integral expressions. Manchon…

We study two notions of being well-structured for classes of graphs that are inspired by classic model theory. A class of graphs $C$ is monadically stable if it is impossible to define arbitrarily long linear orders in vertex-colored graphs…

Let $K_\infty/K$ be a uniform $p$-adic Lie extension. We compare several arithmetic invariants of Iwasawa modules of ideal class groups on the one side and fine Selmer groups of abelian varieties on the other side. If $K_\infty$ contains…

Using the special value at $u=1$ of Artin-Ihara $L$-functions, we associate to every $\mathbb{Z}$-cover of a finite connected graph a polynomial which we call the \emph{Ihara polynomial}. We show that the number of spanning trees for the…

For integer $k\geq2,$ a spanning $k$-ended-tree is a spanning tree with at most $k$ leaves. Motivated by the closure theorem of Broersma and Tuinstra [Independence trees and Hamilton cycles, J. Graph Theory 29 (1998) 227--237], we provide…

In the context of orientable circuits and subcomplexes of these as representing certain singular spaces, we consider characteristic class formulas generalizing those classical results as seen for the Riemann-Hurwitz formula for regulating…

The homotopy algebraic formalism of braided noncommutative field theory is used to define the explicit example of braided electrodynamics, that is, $\mathsf{U}(1)$ gauge theory minimally coupled to a Dirac fermion. We construct the braided…

We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…

We use tools from free probability to study the spectra of Hermitian operators on infinite graphs. Special attention is devoted to universal covering trees of finite graphs. For operators on these graphs we derive a new variational formula…

Let $K$ be an imaginary quadratic field, and fix a prime $p > 3$ that does not divide the class number of $K$. In this paper we prove that Iwasawa's $\lambda$-invariant for the cyclotomic $\mathbb{Z}_p$-extension of $K$ is greater than $1$…

We calculate exponential growth constants $\phi$ and $\sigma$ describing the asymptotic behavior of spanning forests and connected spanning subgraphs on strip graphs, with arbitrarily great length, of several two-dimensional lattices,…

We describe the Lorenz links generated by renormalizable Lorenz maps with reducible kneading invariant $(K_f^-,K_f^+)=(X,Y)*(S,W)$, in terms of the links corresponding to each factor. This gives one new kind of operation that permits us to…

We study aspects of the enumeration of permutation classes, sets of permutations closed downwards under the subpermutation order. First, we consider monotone grid classes of permutations. We present procedures for calculating the generating…

Let $S$ and $X$ be two connected topological surfaces without boundary, and assume that $S$ is either of infinite type or has negative Euler characteristic. In this paper, we prove that if $p:S\rightarrow X$ is a fully ramified branched…

We strengthen and put in a broader perspective previous results of the first two authors on colliding permutations. The key to the present approach is a new non-asymptotic invariant for graphs.

In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…