相关论文: Cyclic coverings of virtual link diagrams

In [8], K. Kaur, S. Kamada et al. posed a problem of finding a virtual knot, if exists, with an unknotting index (n,m), where (n,m) is a pair of non-negative integers. In this paper, we address this question by providing infinite families…

We describe rings over which every right module is almost injective. We give a description of rings over which every simple module is a almost projective.

A link is almost alternating if it is non-alternating and has a diagram that can be transformed into an alternating diagram via one crossing change. We give formulas for the first two and last two potential coefficients of the Jones…

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 study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to $C_k$ for some $k$) instead of cycles (graphs with all degrees even). We give an…

Quasi-alternating links are a natural generalization of alternating links. In this paper, we show that quasi-alternating links are "homologically thin" for both Khovanov homology and knot Floer homology. In particular, their bigraded…

This paper considers the equivalence problem for quasi-cyclic codes over finite fields. The results obtained are used to construct isodual quasi-cyclic codes.

Virtual singular braids are generalizations of singular braids and virtual braids. We define the virtual singular braid monoid via generators and relations, and prove Alexander- and Markov-type theorems for virtual singular links. We also…

We introduce an up-down coloring of a virtual-link diagram. The colorabilities give a lower bound of the minimum number of Reidemeister moves of type II which are needed between two 2-component virtual-link diagrams. By using the notion of…

A classification scheme of the conformal almost contact metric manifolds with respect to the covariant derivative of the Lee form is given. The subclasses of one basic class and their exact characterizations by the maximal subgroups of the…

We prove that parities on virtual knots come from invariant 1-cycles on the arcs of knot diagrams. In turn, the invariant cycles are determined by quasi-indices on the crossings of the diagrams. The found connection between the parities and…

Let m be a positive integer and let G be a cubic graph of order 2n. We consider the problem of covering the edge-set of G with the minimum number of matchings of size m. This number is called excessive [m]-index of G in literature. The case…

Suppose that D is an acyclic orientation of a graph G. An arc of D is called dependent if its reversal creates a directed cycle. Let m and M denote the minimum and the maximum of the number of dependent arcs over all acyclic orientations of…

In this paper we investigate the virtual string links via a probabilistic interpretation. This representation can be used to distinguish some virtual string links from classical string links. In order to study the algebraic structure behind…

A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set L. The weight of a cycle cover of an edge-weighted graph is…

Link homotopy has been an active area of research for knot theorists since its introduction by Milnor in the 1950s. We introduce a new equivalence relation on spatial graphs called component homotopy, which reduces to link homotopy in the…

We introduce a new equivalence relation on decorated ribbon graphs, and show that its equivalence classes directly correspond to virtual links. We demonstrate how this correspondence can be used to convert any invariant of virtual links…

We introduce new topological quantum invariants of compact oriented 3-manifolds with boundary where the boundary is a disjoint union of two identical surfaces. The invariants are constructed via surgery on manifolds of the form $F \times I$…

This paper introduces a method to generate hierarchically modular networks with prescribed node degree list by link switching. Unlike many existing network generating models, our method does not use link probabilities to achieve modularity.…

An $R$-module $M$ is called virtually uniserial if for every finitely generated submodule $0 \neq K \subseteq M$, $K/$Rad$(K)$ is virtually simple. In this paper, we generalize virtually uniserial modules by dropping the virtually simple…