Related papers: Kida's formula for graphs with ramifications

We prove two estimates for the expectation of the exponential of a complex function of a random permutation or subset. Using this theory, we find asymptotic expressions for the expected number of copies and induced copies of a given graph…

We study a natural question in the Iwasawa theory of algebraic curves of genus $>1$. Fix a prime number $p$. Let $X$ be a smooth, projective, geometrically irreducible curve defined over a number field $K$ of genus $g>1$, such that the…

Interpreting the number of ramified covering of a Riemann surface by Riemann surfaces as the relative Gromov-Witten invariants and applying a gluing formula, we derive a recursive formula for the number of ramified covering of a Riemann…

We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…

We study a geometric analogue of the Iwasawa Main Conjecture for constant ordinary abelian varieties over $\ZZ_p^d$-extensions of function fields ramifying at a finite set of places.

Let $k$ be a perfect field of characteristic $p$ and $\Gamma$ an infinite, first countable pro-$p$ group. We study the behavior of the $p$-primary part of the "motivic class group", i.e. the full $p$-divisible group of the Jacobian, in any…

Given a prime number $p$, we study topological analogues of Iwasawa invariants associated to $\mathbb{Z}_p$-covers of the $3$-sphere that are branched along a link. We prove explicit criteria to detect these Iwasawa invariants, and apply…

We define the notion of inseparable coverings of schemes and we propose a ramification formalism for them, along the lines of the classical one. Using this formalism we prove a formula analogous to the classical Riemann-Hurwitz formula for…

We survey the construction and properties of the Yamada polynomial of spatial graphs and present the Yamada polynomial formulae for some classes of graphs. Then we construct an infinite family of spatial graphs for which roots of Yamada…

Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower…

We introduce the extension graph of graph product of groups and study its geometry. This enables us to study properties of graph product by exploiting large scale geometry of its defining graph. In particular, we show that the extension…

A bi-Cayley graph over the cyclic group $(\mathbb{Z}_n, +)$ is called a bicirculant graph. Let $\Gamma=BC(\mathbb{Z}_n; R,T,S)$ be a bicirculant graph with $R=-R\subseteq \mathbb{Z}_n\setminus \{0\}$ and $T={-}T\subseteq…

We calculate the classical Iwasawa invariants of the Iwasawa modules associated to the $p$-adic topological $K$-theory of finite spectra. We show that the graded average of the orders of $n$ consecutive $K(1)$-local homotopy groups of a…

We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…

We consider the family of CM-fields which are pro-p p-adic Lie extensions of number fields of dimension at least two, which contain the cyclotomic Z_p-extension, and which are ramified at only finitely many primes. We show that the Galois…

Let $p$ be a prime number and $m$ an integer coprime to $p$. In the spirit of arithmetic topology, we introduce the notions of the twisted Iwasawa invariants $\lambda, \mu, \nu$ of ${\rm GL}_N$-representations and…

We obtain an explicit expression for the number of ramified coverings of the sphere by the torus with given ramification type for a small number of ramification points, and conjecture this to be true for an arbitrary number of ramification…

We consider the set of all graphs on n labeled vertices with prescribed degrees D=(d_1, ..., d_n). For a wide class of tame degree sequences D we prove a computationally efficient asymptotic formula approximating the number of graphs within…

We define and study a model of winding for non-colliding particles in finite trees. We prove that the asymptotic behavior of this statistic satisfies a central limiting theorem, analogous to similar results on winding of bounded particles…

We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…