Related papers: Determining Genus From Sandpile Torsor Algorithms

In translation surfaces of finite area (corresponding to holomorphic differentials), directions of saddle connections are dense in the unit circle. On the contrary, saddle connections are fewer in translation surfaces with poles…

We determine the asymptotic distribution of the p-rank of the sandpile groups of random bipartite graphs. We see that this depends on the ratio between the number of vertices on each side, with a threshold when the ratio between the sides…

In this paper we provide a principled approach to solve a transductive classification problem involving a similar graph (edges tend to connect nodes with same labels) and a dissimilar graph (edges tend to connect nodes with opposing…

We prove that the (divisorial) gonality of a finite connected graph is lower bounded by its treewidth. We show that equality holds for grid graphs and complete multipartite graphs. We prove that the treewidth lower bound also holds for…

In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…

Brooks and Makover introduced an approach to random Riemann surfaces based on associating a dense set of them - Belyi surfaces - with random cubic graphs. In this paper, using Bollobas model for random regular graphs, we examine the…

Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…

Let $Y$ be a genus $2$ curve over $\mathbb Q$. We provide a method to systematically search for possible candidates of a prime $\ell\geq 3$ and a genus $1$ curve $X$ for which there exists a genus $3$ curve $Z$ over $\mathbb Q$ whose…

While the problem of computing the genus of a knot is now fairly well understood, no algorithm is known for its four-dimensional variants, both in the smooth and in the topological locally flat category. In this article, we investigate a…

Motivated by his work on the classification of countable homogeneous oriented graphs, Cherlin asked about the typical structure of oriented graphs (i) without a transitive triangle, or (ii) without an oriented triangle. We give an answer to…

Every nontrivial abelian variety over a Hilbertian field in which the weak Mordell-Weil theorem holds admits infinitely many torsors with period any $n > 1$ which is not divisible by the characteristic. The corresponding statement with…

We consider fibrations of genus 2 over complex surfaces. The purpose of this paper is primarily to provide a geometric description of the possible structures of the fibration on a neighborhood of a singular fiber. In particular it is shown…

This article is about the graph genus of certain well studied graphs in surface theory: the curve, pants and flip graphs. We study both the genus of these graphs and the genus of their quotients by the mapping class group. The full graphs,…

We introduce the first graph kernels for metric graphs via tropical algebraic geometry. In contrast to conventional graph kernels based on graph combinatorics such as nodes, edges, and subgraphs, our metric graph kernels are purely based on…

This paper addresses the enumeration of rooted and unrooted hypermaps of a given genus. For rooted hypermaps the enumeration method consists of considering the more general family of multirooted hypermaps, in which darts other than the root…

We use a tensor unfolding technique to prove a new identifiability result for discrete bipartite graphical models, which have a bipartite graph between an observed and a latent layer. This model family includes popular models such as…

The sandpile group of a graph is a well-studied object that combines ideas from algebraic graph theory, group theory, dynamical systems, and statistical physics. A graph's sandpile group is part of a larger algebraic structure on the graph,…

Given a variety $X$, and a normal crossings divisor $D\subset X$, we relate, in the case of abelian monodromy, the following two: 1. existence of a $G$-torsor with prescribed ramification, and 2. existence of essentially finite parabolic…

A category N of labeled (oriented) trivalent graphs (nets) or ribbon graphs is extended by new generators called fusing, braiding, twist and switch with relations which can be called Moore--Seiberg relations. A functor to N is constructed…

In this paper we study properties of topological RNA structures, i.e.~RNA contact structures with cross-serial interactions that are filtered by their topological genus. RNA secondary structures within this framework are topological…