Related papers: A duality for labeled graphs and factorizations wi…
The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…
In this paper we prove certain Hurwitz equivalence properties in $B_n$. Our main result is that every two Artin's factorizations of $\Delta_n ^2$ of the form $H_{i_1} ... H_{i_{n(n-1)}}, \quad F_{j_1} ... F_{j_{n(n-1)}}$ (with $i_k, j_k \in…
For any natural number n, the Hurwitz graph $\mathcal{H}(S_n )$ has vertices corresponding to reduced words of the cycle $(1 . . . n)$ in terms of transpositions in $S_n$, and has edges corresponding to local shifts. This graph is known to…
We study embeddings of a graph $G$ in a surface $S$ by considering representatives of different classes of $H_1(S)$ and their intersections. We construct a matrix invariant that can be used to detect homological invariance of elements of…
In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated…
We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…
Graph representation learning (also called graph embeddings) is a popular technique for incorporating network structure into machine learning models. Unsupervised graph embedding methods aim to capture graph structure by learning a…
In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…
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…
We initiate the study of computational complexity of graph coverings, aka locally bijective graph homomorphisms, for {\em graphs with semi-edges}. The notion of graph covering is a discretization of coverings between surfaces or topological…
We give a density condition for when, subject to a necessary parity condition, an eulerian graph or digraph may be cellularly embedded in an orientable surface so that it has exactly two faces, each bounded by an euler circuit, one of which…
We study the problem of finding the minimal (maximal) genus for a surface where a given four-valent graph with fixed opposite edge structure can be embedded into. We find several partial relations and give new reformulations in…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
We introduce a natural structure of a semigroup (isomorphic to a factorization semigroup of the unity in the symmetric group) on the set of irreducible components of Hurwitz space of marked degree $d$ coverings of $\mathbb P^1$ of fixed…
Double Hurwitz numbers have at least four equivalent definitions. Most naturally, they count covers of the Riemann sphere by genus g curves with certain specified ramification data. This is classically equivalent to counting certain…
Let $G$ be a finite group and $\chi: G \rightarrow \mathbb{C}$ a class function. Let $H = (V,E)$ be a directed graph with for each vertex a cyclic order of the edges incident to it. The cyclic orders give a collection $F$ of faces of $H$.…
To a weighted graph can be associated a bipartite graph planar algebra P. We construct and study the symmetric enveloping inclusion of P. We show that this construction is equivariant with respect to the automorphism group of P. The…
We introduce a categorical formalism for rewriting surface-embedded graphs. Such graphs can represent string diagrams in a non-symmetric setting where we guarantee that the wires do not intersect each other. The main technical novelty is a…
It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…
We describe a construction for embeddings of complete graphs where the dual has a cutvertex and the genus is close to the minimum genus of the primal graph. When the number of vertices is congruent to 5 modulo 12, we further guarantee that…