English
Related papers

Related papers: Kida's formula for graphs with ramifications

200 papers

We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…

Combinatorics · Mathematics 2007-07-18 Matthew Baker , Serguei Norine

Let X -> P^1 be a general cyclic cover. We give a simple formula for the number of equivariant meromorphic functions on X subject to ramification conditions at variable points. This generalizes and gives a new proof of a recent result of…

Algebraic Geometry · Mathematics 2021-10-05 Carl Lian , Riccardo Moschetti

We consider several differential-topological invariants of compact 4-manifolds which directly arise from Riemannian variational problems. Using recent results of Bauer and Furuta, we compute these invariants in many cases that were…

Differential Geometry · Mathematics 2007-05-23 Masashi Ishida , Claude LeBrun

As an extension of the class of algebraic links, A'Campo, Gibson, and Ishikawa constructed links associated to immersed arcs and trees in a two-dimensional disk. By extending their arguments, we construct links associated to immersed graphs…

Geometric Topology · Mathematics 2014-10-01 Tomomi Kawamura

For primes $q \equiv 7 \mod 16$, the present manuscript shows that elementary methods enable one to prove surprisingly strong results about the Iwasawa theory of the Gross family of elliptic curves with complex multiplication by the ring of…

Number Theory · Mathematics 2020-08-25 John Coates , Jianing Li , Yongxiong Li

We give two algorithms to compute layers of the anticyclotomic ${\bf Z}_3$-extension of an imaginary quadratic field. The first is based on complex multiplication techniques for nonmaximal orders; the second is based on Kummer theory. As an…

Number Theory · Mathematics 2019-02-13 Reinier Broker , David Hubbard , Lawrence C. Washington

Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic structures) where there is no known tree-width analogue. Here we…

Combinatorics · Mathematics 2022-06-22 Benjamin Merlin Bumpus , Zoltan A. Kocsis

The aim of the present paper is on the one hand to produce examples supporting the conclusion of Y. Namikawa in Remark 2.8 of \cite{N} and improving considerations of Example 1.11 of the same paper. On the other hand, it is intended to give…

Algebraic Geometry · Mathematics 2014-08-29 Michele Rossi

We study how Tamagawa numbers of Jacobians of hyperelliptic curves vary as one varies the base field or the curve, in the case of semistable reduction. We find that there are strong constraints on the behaviour that appears, some of which…

Number Theory · Mathematics 2020-08-31 L. Alexander Betts

This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader…

Combinatorics · Mathematics 2018-05-08 David Conlon , Jeong Han Kim , Choongbum Lee , Joonkyung Lee

Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r,…

Combinatorics · Mathematics 2007-05-23 Jaroslav Nesetril , Patrice Ossona De Mendez

A new very simple proof of the number of labeled rooted forest-graphs with a given number of vertices is given. As a partial case of this formula we have Cayley's formula.

Mathematical Physics · Physics 2022-02-07 Alexei L. Rebenko

Computing the embedding distribution of a given graph is a fundamental question in topological graph theory. In this article, we extend our viewpoint to a sequence of graphs and consider their asymptotic embedding distributions, which are…

Combinatorics · Mathematics 2025-07-22 Yichao Chen , Wenjie Fang , Zhicheng Gao , Jinlian Zhang

Let r : G_Q -> GL_2(Fpbar) be a p-ordinary and p-distinguished irreducible residual modular Galois representation. We show that the vanishing of the algebraic or analytic Iwasawa mu-invariant of a single modular form lifting r implies the…

Number Theory · Mathematics 2009-11-10 Matthew Emerton , Robert Pollack , Tom Weston

We develop a tool for embedding almost spanning degenerate graphs of small bandwidth. As an application, we extend the blow-up lemma to degenerate graphs of small bandwidth, the bandwidth theorem to degenerate graphs, and make progress on a…

Combinatorics · Mathematics 2015-01-27 Choongbum Lee

When the Seiberg-Witten curve of a four-dimensional $\mathcal{N}=2$ supersymmetric gauge theory wraps a Riemann surface as a multi-sheeted cover, a topological constraint requires that in general the curve should develop ramification…

High Energy Physics - Theory · Physics 2015-03-18 Chan Y. Park

A graph has tree-width at most $k$ if it can be obtained from a set of graphs each with at most $k+1$ vertices by a sequence of clique sums. We refine this definition by, for each non-negative integer $\theta$, defining the…

Combinatorics · Mathematics 2016-09-30 Jim Geelen , Benson Joeris

For $n$-vertex, $d$-dimensional lattices $\Lambda$ with $d \ge 2$, the number of spanning trees $N_{ST}(\Lambda)$ grows asymptotically as $\exp(n z_\Lambda)$ in the thermodynamic limit. We present an exact closed-form result for the…

Statistical Mechanics · Physics 2009-11-11 Shu-Chiuan Chang , Robert Shrock

We consider hereditary classes of graphs equipped with a total order. We provide multiple equivalent characterisations of those classes which have bounded twin-width. In particular, we prove a grid theorem for classes of ordered graphs…

Logic in Computer Science · Computer Science 2021-07-07 Pierre Simon , Szymon Toruńczyk

We prove a refinement of the tree packing theorem by Tutte/Nash-Williams for finite graphs. This result is used to obtain a similar result for end faithful spanning tree packings in certain infinite graphs and consequently to establish a…

Combinatorics · Mathematics 2013-09-19 Florian Lehner