相关论文: Cyclic coverings of virtual link diagrams
Let $G$ and $H$ be disjoint embeddings of complete graphs $K_m$ and $K_n$ in $\mathbb{R}^3$ such that some cycle in $G$ links a cycle in $H$ with non-zero linking number. We say that $G$ and $H$ are *weakly linked* if the absolute value of…
Clustering a graph when the clusters can overlap can be seen from three different angles: We may look for cliques that cover the edges of the graph with bounded overlap, we may look to add or delete few edges to uncover the cluster…
Construction of subspace codes with good parameters is one of the most important problems in random network coding. In this paper we present first a generalization of the concept of cyclic subspaces codes and further we show that the usual…
We extend the notion of link colorings with values in an Alexander quandle to link colorings with values in a module $M$ over the Laurent polynomial ring $\Lambda_{\mu}=\mathbb{Z}[t_1^{\pm1},\dots,t_{\mu}^{\pm1}]$. If $D$ is a diagram of a…
In this paper, we construct proper pushforwards and flat pullbacks in Chow groups of coherent sheaf stacks over a Deligne-Mumford(DM) stack. When there is a relative semi-perfect obstruction theory for a DM-type morphism $X \to Y$, $X$ is a…
We discuss a general parametrization for vertices of quantum graphs and show, in particular, how the $\delta'_s$ and $\delta'$ coupling at an $n$ edge vertex can be approximated by means of $n+1$ couplings of the $\delta$ type provided the…
We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a cyclic orbit code and a certain linear set on the projective…
We say that a link $L_1$ is an s-major of a link $L_2$ if any diagram of $L_1$ can be transformed into a diagram of $L_2$ by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime…
We investigate {\em multidimensional covering mechanism-design} problems, wherein there are $m$ items that need to be covered and $n$ agents who provide covering objects, with each agent $i$ having a private cost for the covering objects he…
We propose a novel and efficient method for link prediction in bipartite networks, using \textit{formal concept analysis} (FCA) and the Transformer encoder. Link prediction in bipartite networks finds practical applications in various…
The mock Alexander polynomial is an extension of the classical Alexander polynomial, defined and studied for (virtual) knots and knotoids by the second and third authors. In this paper we consider the mock Alexander polynomial for…
The splitting number of a link is the minimal number of crossing changes between different components required, on any diagram, to convert it to a split link. We introduce new techniques to compute the splitting number, involving covering…
We construct various functorial maps (projections) from virtual knots to classical knots. These maps are defined on diagrams of virtual knots; in terms of Gauss diagram each of them can be represented as a deletion of some chords. The…
In the prequel of this paper, Kauffman and Ogasa introduced 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…
For $k \ge 4$, let $Q_{2k}$ and $V_{2k}$ denote the ladder and M\"obius ladder on $2k$ vertices, respectively. We prove results that build on a result by Wormald that states that any cyclically $4$-connected cubic graph other than $Q_8$ or…
We introduce the notion of mc-biquandles, algebraic structures which have possibly distinct biquandle operations at single-component and multi-component crossings. These structures provide computable homset invariants for classical and…
We suggest a new random model for links based on meander diagrams and graphs. We then prove that trivial links appear with vanishing probability in this model, no link $L$ is obtained with probability 1, and there is a lower bound for the…
We introduce the notion of quasi-triviality of quandles and define homology of quasi-trivial quandles. Quandle cocycle invariants are invariant under link-homotopy if they are associated with 2-cocycles of quasi-trivial quandles. We thus…
This study introduces a method for simulating quantum systems using electrical networks. Our approach leverages a generalized similarity transformation, which connects different Hamiltonians, enabling well-defined paths for quantum system…
We construct links of arbitrarily many components each component of which is slice and yet are not concordant to any link with even one unknotted component. The only tool we use comes from the Alexander modules.