Related papers: A duality for labeled graphs and factorizations wi…
We study the problem of computing the homology of the configuration spaces of a finite cell complex $X$. We proceed by viewing $X$, together with its subdivisions, as a subdivisional space--a kind of diagram object in a category of cell…
Usually a name of the category is inherited from the name of objects. However more relevant for a category of objects and morphisms is an algebra of morphisms. Therefore we prefer to say a category of graphs if every morphism is a graph. In…
Learning good quality neural graph embeddings has long been achieved by minimizing the point-wise mutual information (PMI) for co-occurring nodes in simulated random walks. This design choice has been mostly popularized by the direct…
The enormous amount of data to be represented using large graphs exceeds in some cases the resources of a conventional computer. Edges in particular can take up a considerable amount of memory as compared to the number of nodes. However,…
Factorization algebras are local-to-global objects living on manifolds, and they arise naturally in mathematics and physics. Their local structure encompasses examples like associative algebras and vertex algebras; in these examples, their…
It is well-known that the factorization properties of a domain are reflected in the structure of its group of divisibility. The main theme of this paper is to introduce a topological/graph-theoretic point of view to the current…
A "folklore conjecture, probably due to Tutte" (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341-355, Academic Press, 1979]) asserts that every bridgeless cubic…
Many quantities of interest in communications, signal processing, artificial intelligence, and other areas can be expressed as the partition sum of some factor graph. Although the exact calculation of the partition sum is in many cases…
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
In this article, we mainly obtain the Riemann-Hurwitz theorems for harmonic morphisms on (vertex-weighted) metric graphs or metrized complexes of algebraic curves, inspired of the recent work on harmonic morphisms of graphs or metrized…
We discuss an interesting duality known to occur for certain complex reflection groups, namely the duality groups. Our main construction yields a concrete, representation theoretic realisation of this duality. This allows us to naturally…
We extend the theory of combinatorial link Floer homology to a class of oriented spatial graphs called transverse spatial graphs. To do this, we define the notion of a grid diagram representing a transverse spatial graph, which we call a…
The \emph{graph realization problem} is to find for given nonnegative integers $a_1,\dots,a_n$ a simple graph (no loops or multiple edges) such that each vertex $v_i$ has degree $a_i.$ Given pairs of nonnegative integers…
Directed graphs have long been used to gain understanding of the structure of semigroups, and recently the structure of directed graph semigroups has been investigated resulting in a characterization theorem and an analog of Fruct's…
We study the asymptotic behaviour of random factorizations of the $n$-cycle into transpositions of fixed genus $g>0$. They have a geometric interpretation as branched covers of the sphere and their enumeration as Hurwitz numbers was…
We discuss the equivalence between the categories of certain ribbon graphs and subgroups of the modular group $\Gamma$ and use it to construct exponentially large families of not Hurwitz equivalent simple braid monodromy factorizations of…
We obtain the double factorization of braided bialgebras or braided Hopf algebras, give relation among integrals and semisimplicity of braided Hopf algebra and its factors.
In contrast to the abundance of "direct" Ramsey results for classes of finite structures (such as finite ordered graphs, finite ordered metric spaces and finite posets with a linear extension), in only a handful of cases we have a…
We introduce and develop a language of semigroups over the braid groups for a study of braid monodromy factorizations (bmf's) of plane algebraic curves and other related objects. As an application we give a new proof of Orevkov's theorem on…
Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…