Related papers: Determining Genus From Sandpile Torsor Algorithms
Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if, and only if, they are homomorphism indistinguishable over all graphs, i.e., $G$ and $H$ admit the same number of number of homomorphisms from every graph $F$.…
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…
We study genus 2 covers of relative elliptic curves over an arbitrary base in which 2 is invertible. Particular emphasis lies on the case that the covering degree is 2. We show that the data in the "basic construction" of genus 2 covers of…
The genus of satellite tunnel number one knots and torti-rational knots is computed using the tools introduced by Floyd and Hatcher. An implementation of an algorithm is given to compute genus and slopes of minimal genus Seifert surfaces…
Given any irreducible smooth complex projective curve $X$, of genus at least $2$, consider the moduli stack of vector bundles on $X$ of fixed rank and determinant. It is proved that the isomorphism class of the stack uniquely determines the…
This research report outlines work, partially joint with Jeremy Kahn and Kevin Pilgrim, which gives parallel theories of elastic graphs and conformal surfaces with boundary. One one hand, this lets us tell when one rubber band network is…
A normal subgroup of the (extended) mapping class group of a surface is said to be geometric if its automorphism group is the mapping class group. We prove that in the case of the Cantor tree surface, every normal subgroup is geometric. We…
In the mid-1990s, two groups of authors independently obtained classifications of vertex-transitive graphs whose order is a product of two distinct primes. In the intervening years it has become clear that there is additional information…
We give an efficient, deterministic algorithm to decide if two abelian varieties over a number field are isogenous. From this, we derive an algorithm to compute the endomorphism ring of an elliptic curve over a number field.
In the topological category, the classification of homotopy ribbon discs is known when the fundamental group $G$ of the exterior is $\mathbb{Z}$ and the Baumslag-Solitar group $BS(1,2)$. We prove that if a group $G$ is geometrically…
In this paper, topological indices play a significant role in the analysis of caterpillar trees, especially due to their applications in chemical graph theory. We presented a study on topological indices related to the Sigma index, which we…
We study a variety of natural constructions from topological combinatorics, including matching complexes as well as other graph complexes, from the perspective of the graph minor category of \parencite{MiProRa}. We prove that these…
We connect several notions relating the structural and dynamical properties of a graph. Among them are the topological entropy coming from the vertex shift, which is related to the spectral radius of the graph's adjacency matrix, the…
We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of…
We consider non-trivial homomorphisms to reflexive oriented graphs in which some pair of adjacent vertices have the same image. Using a notion of convexity for oriented graphs, we study those oriented graphs that do not admit such…
The problem of inferring unknown graph edges from numerical data at a graph's nodes appears in many forms across machine learning. We study a version of this problem that arises in the field of \emph{landscape genetics}, where genetic…
A Richardson variety in a flag variety is an intersection of two Schubert varieties defined by transverse flags. We define and study relative Richardson varieties, which are defined over a base scheme with a vector bundle and two flags. To…
Genus 5 curves can be hyperelliptic, trigonal, or non-hyperelliptic non-trigonal, whose model is a complete intersection of three quadrics in $\mathbb{P}^4$. We present and explain algorithms we used to determine, up to isomorphism over…
Crossings of knot diagrams can be divided into classes (tribes) compatible with Reidemeister moves. Tribes can be considered as localization of the notion of weak chord index introduced by M. Xu. In the article we describe tribes of…
It is well known that there is a bijective correspondence between metric ribbon graphs and compact Riemann surfaces with meromorphic Strebel differentials. In this article, it is proved that Grothendieck's correspondence between dessins…