相关论文: Cyclic coverings of virtual link diagrams

We construct new invariant polynomial for long virtual knots. It is a generalization of Alexander polynomial. We designate it by $\zeta$ meaning an analogy with $\zeta$-polynomial for virtual links. A degree of $\zeta$-polynomial estimates…

We prove that there is an algorithm to decide whehter two virtual links are equivalent or not

We propose a modal logic tailored to describe graph transformations and discuss some of its properties. We focus on a particular class of graphs called termgraphs. They are first-order terms augmented with sharing and cycles. Termgraphs…

The Alexander biquandle of a virtual knot or link is a module over a 2-variable Laurent polynomial ring which is an invariant of virtual knots and links. The elementary ideals of this module are then invariants of virtual isotopy which…

We introduce a new very large family of transformations of rectangular diagrams of links that preserve the isotopy class of the link. We provide an example when two diagrams of the same complexity are related by such a transformation and…

In this paper we discuss how to define a chord index via smoothing a real crossing point of a virtual knot diagram. Several polynomial invariants of virtual knots and links can be recovered from this general construction. We also explain…

Metacirculants are a rich resource of many families of interesting graphs, and weak metacirculants are generalizations of them. A graph is called a {\em split weak metacirculant} if it has a vertex-transitive split metacyclic automorphism…

We introduce cyclic diagram monoids, a generalisation of classical diagram monoids that adds elements of arbitrary period by including internal components, with a view towards cryptography. We classify their simple representations and…

A non-planar graph is almost-planar if either deleting or contracting any edge makes it planar. A graph with $n$ vertices is pancyclic if it contains a cycle of every length from $3$ to $n$, and it is Hamiltonian if it contains a cycle of…

We generalize the results of Chang-Li, Kim-Oh and Chang-Li on the moduli of $p$-fields to the setting of (quasi-)maps to complete intersections in arbitrary smooth Deligne-Mumford stacks with projective coarse moduli. In particular, we show…

For a non-split multi-crossing diagram $D$ of a link $L$ we show that $\alpha(L)-2 \leq c_2(D) + \sum_{n> 2}(2n-4)c_n(D)$ holds. Here $\alpha(L)$ is the arc index and $c_n(D)$ is the number of $n$-crossings of $D$. This generalizes and…

The Minimum Path Cover (MPC) problem consists of finding a minimum-cardinality set of node-disjoint paths that cover all nodes in a given graph. We explore a variant of the MPC problem on acyclic digraphs (DAGs) where, given a subset of…

The constructions of the virtual Euler (or moduli) cycles and their properties are explained and developed systematically in the general abstract settings.

The aim of this article is to detect new classes of quasi-alternating links. Quasi-alternating links are a natural generalization of alternating links. Their knot Floer and Khovanov homology are particularly easy to compute. Since knot…

Thin coverings are a method of constructing graded-simple modules from simple (ungraded) modules. After a general discussion, we classify the thin coverings of (quasifinite) simple modules over associative algebras graded by finite abelian…

In this paper, we present necessary and sufficient combinatorial conditions for a link to be projective, that is, a link in $RP^3$. This characterization is closely related to the notions of antipodally self-dual and antipodally symmetric…

A regular cover of a connected graph is called {\em cyclic} or {\em dihedral} if its transformation group is cyclic or dihedral respectively, and {\em arc-transitive} (or {\em symmetric}) if the fibre-preserving automorphism subgroup acts…

I show how to construct Monte Carlo algorithms (programs), prove that they are correct and document them. Complicated algorithms are build using a handful of elementary methods. This construction process is transparently illustrated using…

Let $L$ be a oriented link such that $\Sigma_n(L)$, the $n$-fold cyclic cover of $S^3$ branched over $L$, is an L-space for some $n \geq 2$. We show that if either $L$ is a strongly quasipositive link other than one with Alexander…

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…