English
Related papers

Related papers: Ribbon graphs and meromorphic functions

200 papers

It is a consequence of the Jacobi Inversion Theorem that a line bundle over a Riemann surface M of genus g has a meromorphic section having at most g poles, or equivalently, the divisor class of a divisor D over M contains a divisor having…

Complex Variables · Mathematics 2015-10-28 Joseph A. Ball , Kevin F. Clancey , Victor Vinnikov

The end compactification |\Gamma| of the locally finite graph \Gamma is the union of the graph and its ends, endowed with a suitable topology. We show that \pi_1(|\Gamma|) embeds into a nonstandard free group with hyperfinitely many…

Geometric Topology · Mathematics 2012-03-30 Isaac Goldbring , Alessandro Sisto

Let $G$ be a simple topological graph and let $\Gamma$ be a polyline drawing of $G$. We say that $\Gamma$ \emph{partially preserves the topology} of $G$ if it has the same external boundary, the same rotation system, and the same set of…

Computational Geometry · Computer Science 2018-09-24 Emilio Di Giacomo , Peter Eades , Giuseppe Liotta , Henk Meijer , Fabrizio Montecchiani

The independent domination number $i(G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$, also called an $i(G)$-set. The $i$-graph of $G$ is the graph whose vertices correspond to the $i(G)$-sets, and where two…

Combinatorics · Mathematics 2023-05-30 Richard Brewster , Kieka Mynhardt , Laura Teshima

Theta identities on genus g Riemann surfaces which decompose simple products of fermion correlation functions with a constraint on their variables are considered. This type of theta identities is, in a sense, dual to Fay s formula, by which…

High Energy Physics - Theory · Physics 2017-11-23 A. G. Tsuchiya

The cross topology $\gamma$ on a product of topological spaces $X$ and $Y$ is the collection of all sets $G\subseteq X\times Y$ such that the intersection of $G$ with every vertical line and every horizontal line is an open subset of either…

General Topology · Mathematics 2016-01-25 Olena Karlova , Volodymyr Mykhaylyuk

The work provides a brief intuitive overview theory of graph on surfaces. We considers graphs with an additional structure, wich we call discs with ribbons, also known as one-vertex ribbon graphs. And solves the problem (Skopenkov's) about…

Combinatorics · Mathematics 2025-07-03 Tim Berezin

Let $p$ be a real number greater than one and let $\Gamma$ be a connected graph of bounded degree. We show that the $p$-Royden boundary of $\Gamma$ with the $p$-harmonic boundary removed is a $F_{\sigma}$-set. We also characterize the…

Functional Analysis · Mathematics 2011-08-11 Michael Puls

From a graph $G$ with constant valency $v$ and a (non-compact) manifold $C$ with $v$ boundary components, we build a $G$-periodic manifold $M$. This process gives a class of topologically infinite manifolds which generalizes periodic…

Differential Geometry · Mathematics 2010-01-15 Samuel Tapie

In this paper, we analyze embeddings of grid graphs on orientable surfaces. We determine the genus of a large class of k-dimensional grid graphs and effective two-sided bounds for the genus of any 3-dimensional grid graph, both in terms of…

Combinatorics · Mathematics 2022-04-20 Christian Millichap , Fabian Salinas

Let $\Lambda(T)$ denote the set of leaves in a tree $T$. One natural problem is to look for a spanning tree $T$ of a given graph $G$ such that $\Lambda(T)$ is as large as possible. This problem is called maximum leaf number, and it is a…

Combinatorics · Mathematics 2026-02-19 Peter Bradshaw , Tomáš Masařík , Jana Novotná , Ladislav Stacho

Given a `genus' function $g=g(n)$, we let $\mathcal{E}^g$ be the class of all graphs $G$ such that if $G$ has order $n$ (that is, has $n$ vertices) then it is embeddable in a surface of Euler genus at most $g(n)$. Let the random graph $R_n$…

Combinatorics · Mathematics 2021-08-18 Colin McDiarmid , Sophia Saller

Let $\Gamma$ be a connected bridgeless metric graph, and fix a point $v$ of $\Gamma$. We define combinatorial iterated integrals on $\Gamma$ along closed paths at $v$, a unipotent generalization of the usual cycle pairing and the…

Combinatorics · Mathematics 2021-02-04 Raymond Cheng , Eric Katz

In this paper, we introduce and investigate a novel subclass $\Sigma(\theta, \lambda, \gamma)$ of meromorphic functions defined in the punctured unit disk ${D}^*$. This class is constructed utilizing a specialized generalized operator…

Complex Variables · Mathematics 2026-05-22 Anish Kumar

We construct a parabolic entire minimal graph $S$ over a finite topology complete Riemannian surface $\Sigma$ of curvature $-1$ and infinite area (thus of non-parabolic conformal type). The vertical projection of this graph yields a…

Differential Geometry · Mathematics 2016-07-19 Laurent Mazet , Magdalena Rodriguez , Harold Rosenberg

Let $\Sigma=(\Gamma, \sigma)$ is a signed graph(or sigraph in short), where $\Gamma$ is a underlying graph of $\Sigma$ and $\sigma:E\longrightarrow \{+, -\}$ is a function. Consider $\Gamma=Cay(\mathbb{Z}_{p_{1}}\times…

Combinatorics · Mathematics 2020-11-12 Mohammad A. Iranmanesh , Nasrin Moghaddami

We show that extending an embedding of a graph $\Gamma$ in a surface to an embedding of a Hamiltonian supergraph can be blocked by certain planar subgraphs but, for some subdivisions of $\Gamma$, Hamiltonian extensions must exist.

Combinatorics · Mathematics 2023-10-04 Paul C. Kainen , Shannon Overbay

The {\em topological symmetry group} of an embedding $\Gamma$ of an abstract graph $\gamma$ in $S^3$ is the group of automorphisms of $\gamma$ which can be realized by homeomorphisms of the pair $(S^3, \Gamma)$. These groups are motivated…

Geometric Topology · Mathematics 2023-06-26 Deion Elzie , Samir Fridhi , Blake Mellor , Daniel Silva , Robin Wilson

Ribbon graphs embedded on a Riemann surface provide a useful way to describe the double line Feynman diagrams of large N computations and a variety of other QFT correlator and scattering amplitude calculations, e.g in MHV rules for…

High Energy Physics - Theory · Physics 2015-06-11 Robert de Mello Koch , Sanjaye Ramgoolam , Congkao Wen

The sensitivity, $\sigma(G)$, of a finite undirected simple graph $G$ is the smallest maximum degree of an induced subgraph on more than the maximum number of independent vertices. Call an indexed family of graphs $G_n$ with maximum degree…

Combinatorics · Mathematics 2026-03-18 Cathy Kriloff , Jacob Tolman