Related papers: Ribbon graphs and meromorphic functions

In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically been applied to Graph Isomorphism. In particular, we show…

The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting functions is described. The problem is reduced to describing…

We study the related questions: (i) when Feynman amplitudes in massless $\phi^4$ theory evaluate to multiple zeta values, and (ii) when their underlying motives are mixed Tate. More generally, by considering configurations of singular…

For compact regions Omega in R^3 with generic smooth boundary B, we consider geometric properties of Omega which lie midway between their topology and geometry and can be summarized by the term "geometric complexity". The "geometric…

Let $R$ be a commutative ring with identity. We define a graph $\Gamma_{\aut}(R)$ on $ R$, with vertices elements of $R$, such that any two distinct vertices $x, y$ are adjacent if and only if there exists $\sigma \in \aut$ such that…

Consider a discrete locally finite subset $\Gamma$ of $R^d$ and the complete graph $(\Gamma,E)$, with vertices $\Gamma$ and edges $E$. We consider Gibbs measures on the set of sub-graphs with vertices $\Gamma$ and edges $E'\subset E$. The…

We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…

We consider the compactification M(atrix) theory on a Riemann surface Sigma of genus g>1. A natural generalization of the case of the torus leads to construct a projective unitary representation of pi_1(\Sigma), realized on the Hilbert…

The fine 1-curve graph of a surface is a graph whose vertices are simple closed curves on the surface and whose edges connect vertices that intersect in at most one point. We show that the automorphism group of the fine 1-curve graph is…

In this note we introduce a notion of a morphism between two hyperbolic iterated function systems. We prove that the graph of a morphism is the attractor of an iterated function system, giving a Closed Graph Theorem, and show how it can be…

To a finite, connected, unoriented graph of Betti-number g>=2 and valencies >=3 we associate a finitely summable, commutative spectral triple (in the sense of Connes), whose induced zeta functions encode the graph. This gives another…

Representing graphs as sets of node embeddings in certain curved Riemannian manifolds has recently gained momentum in machine learning due to their desirable geometric inductive biases, e.g., hierarchical structures benefit from hyperbolic…

Given a compact surface $\Gamma$ embedded in $\mathbb R^3$ with boundary $\partial \Gamma$, our goal is to construct a set of representatives for a basis of the relative cohomology group $H^1(\Gamma, \partial \Gamma^c)$, where $\Gamma^c$ is…

Let $\gamma$ be a filling curve on a topological surface $\Sigma$ of genus $g \geq 2$. The inf invariant of $\gamma$, denoted $m_{\gamma}$, is the infimum of the length function on the space of marked hyperbolic structures on $\Sigma$. This…

By refining the volume estimate of Heintze and Karcher \cite{HK}, we obtain a sharp pinching estimate for the genus of a surface in $\mathbb S^{3}$, which involves an integral of the norm of its traceless second fundamental form. More…

There is a Turing computable embedding $\Phi$ of directed graphs $A$ in undirected graphs. Moreover, there is a fixed tuple of formulas that give a uniform interpretation; i.e., for all directed graphs $A$, these formulas interpret $A$ in…

We give an explicit example of a fibration $f \colon X \to Y$ between smooth projective varieties whose "orbifold base" $\Delta_f$ in the sense of Campana has the property that the induced morphism $X \to (Y, \Delta_f)$ is not a morphism of…

The Subgraph Isomorphism problem asks, given a host graph G on n vertices and a pattern graph P on k vertices, whether G contains a subgraph isomorphic to P. The restriction of this problem to planar graphs has often been considered. After…

Let $\mathcal{F}$ be a set of connected graphs, and let $G$ be a graph. We say that $G$ is \emph{$\mathcal{F}$-free} if it does not contain $F$ as an induced subgraph for all $F\in\mathcal{F}$, and we call $\mathcal{F}$ a forbidden pair if…

Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…