Related papers: A duality for labeled graphs and factorizations wi…
Motivated by the problem of Hurwitz equivalence of $\Delta ^2$ factorization in the braid group, we address the problem of Hurwitz equivalence in the symmetric group, obtained by projecting the $\Delta ^2$ factorizations into $S_n$. We get…
We consider two operations on an edge of an embedded graph (or equivalently a ribbon graph): giving a half-twist to the edge and taking the partial dual with respect to the edge. These two operations give rise to an action of S_3^{|E(G)|},…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
The aim of this paper is to present a few versions of the Riemann-Hurwitz formula for a regular branched covering of graphs. By a graph, we mean a finite connected multigraph. The genus of a graph is defined as the rank of the first…
It is known that graphs cellularly embedded into surfaces are equivalent to ribbon graphs. In this work, we generalize this statement to broader classes of graphs and surfaces. Half-edge graphs extend abstract graphs and are useful in…
Knowledge graph embedding involves learning representations of entities -- the vertices of the graph -- and relations -- the edges of the graph -- such that the resulting representations encode the known factual information represented by…
The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections…
Delta-matroid theory is often thought of as a generalization of topological graph theory. It is well-known that an orientable embedded graph is bipartite if and only if its Petrie dual is orientable. In this paper, we first introduce the…
The dual normal factor graph and the factor graph duality theorem have been considered for discrete graphical models. In this paper, we show an application of the factor graph duality theorem to continuous graphical models. Specifically, we…
A conceptual framework involving partition functions of normal factor graphs is introduced, paralleling a similar recent development by Al-Bashabsheh and Mao. The partition functions of dual normal factor graphs are shown to be a Fourier…
Pairs of graded graphs, together with the Fomin property of graded graph duality, are rich combinatorial structures providing among other a framework for enumeration. The prototypical example is the one of the Young graded graph of integer…
We generalize the natural duality of graphs embedded into a surface to a duality with respect to a subset of edges. The dual graph might be embedded into a different surface. We prove a relation between the signed Bollobas-Riordan…
In statistical relational learning, knowledge graph completion deals with automatically understanding the structure of large knowledge graphs---labeled directed graphs---and predicting missing relationships---labeled edges. State-of-the-art…
In this paper we prove certain Hurwitz equivalence properties in the braid group. Our main result is that every two factorizations of $\Delta_n ^2$ where the elements of the factorization are semi-frame are Hurwitz equivalent. The results…
We follow the same technics we used before in \cite{AZ} of extending knot Floer homology to embedded graphs in a 3-manifold, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such…
We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links.…
Given a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. D\'enes proved that the permutation is a full cyclic permutation…
Traditional representations of graphs and their duals suggest the requirement that the dual vertices be placed inside their corresponding primal faces, and the edges of the dual graph cross only their corresponding primal edges. We consider…
We consider two-dimensional N=(2,2) supersymmetric gauge theory on discretized Riemann surfaces. We find that the discretized theory can be efficiently described by using graph theory, where the bosonic and fermionic fields are regarded as…
We study the interplay between the classical theory of linear series on curves, and the recent theory of linear series on graphs. We prove that every d-gonal (weighted) graph of Hurwitz type is the dual graph of a d-gonal curve. Conversely…