Related papers: On ribbon graphs and virtual links

The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…

We use virtual knot theory to detect the non-invertibility of some classical links in $\mathbb{S}^3$. These links appear in the study of virtual covers. Briefly, a virtual cover associates a virtual knot $\upsilon$ to a knot $K$ in a…

A rainbow graph is a graph that admits a vertex-coloring such that every color appears exactly once in the neighborhood of each vertex. We investigate some properties of rainbow graphs. In particular, we show that there is a bijection…

The virtual skein relation for the Jones polynomial of the virtual link diagram was introduced by N. Kamada, S. Nakabo, and S. Satoh. H. A. Dye, L. H. Kauffman, and Y. Miyazawa introduced multivariable polynomial, an invariant of virtual…

In this paper we indicate one method of construction of linear representations of groups and algebras with translation invariant (except, maybe , finite number) defining relationships. As an illustration of this method, we give one approach…

In [DKO] we constructed virtual fundamental classes $[[ Hilb^m_V ]]$ for Hilbert schemes of divisors of topological type m on a surface V, and used these classes to define the Poincare invariant of V: (P^+_V,P^-_V): H^2(V,Z) --> \Lambda^*…

We introduce ribbon-moves of 2-knots, which are operations to make 2-knots into new 2-knots by local operations in B^4. (We do not assume the new knots is not equivalent to the old ones.) Let L_1 and L_2 be 2-links. Then the following hold.…

We generalize Milnor link invariants to all types of surface-links in $4$--space (possibly with boundary). This is achieved by using the notion of cut-diagram, which is a 2-dimensional generalization of Gauss diagrams, associated to…

We study Thurston equivalence classes of quadratic post-critically finite branched coverings. For these maps, we introduce and study invariant spanning trees. We give a computational procedure for searching for invariant spanning trees.…

Two welded (respectively virtual) link diagrams are homotopic if one may be transformed into the other by a sequence of extended Reidemeister moves, classical Reidemeister moves, and self crossing changes. In this paper, we extend Milnor's…

We define half grid diagrams and prove every link is half grid presentable by constructing a canonical half grid pair (which gives rise to a grid diagram of some special type) associated with an element in the oriented Thompson group. We…

We provide recipe theorems for the Bollob\`as and Riordan polynomial $\mathcal{R}$ defined on classes of ribbon graphs with half-edges introduced in arXiv:1310.3708[math.GT]. We also define a generalized transition polynomial $Q$ on this…

We consider the problem of embedding a relation, represented as a directed graph, into Euclidean space. For three types of embeddings motivated by the recent literature on knowledge graphs, we obtain characterizations of which relations…

In this paper we verify that the graph forms a complete invariant for Banach algebra isomorphisms of tensor algebras of graphs. For tensor algebras associated with countable directed graphs having no sinks the graph forms an invariant for…

For a classical link, Milnor defined a family of isotopy invariants, called Milnor $\overline{\mu}$-invariants. Recently, Chrisman extended Milnor $\overline{\mu}$-invariants to welded links by a topological approach. The aim of this paper…

Scaled relative graphs were recently introduced to analyze the convergence of optimization algorithms using two dimensional Euclidean geometry. In this paper, we connect scaled relative graphs to the classical theory of input/output…

A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that…

We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex $u$ is represented by a geometric object $R(u)$ and in which each edge $(u,v)$ is represented…

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…

Graphs are one of the most important data structures for representing pairwise relations between objects. Specifically, a graph embedded in a Euclidean space is essential to solving real problems, such as physical simulations. A crucial…