相关论文: Cyclic coverings of virtual link diagrams
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. We investigate how well L-cycle covers of minimum weight…
Correlation clustering is a widely-used approach for clustering large data sets based only on pairwise similarity information. In recent years, there has been a steady stream of better and better classical algorithms for approximating this…
We propose an algebraic method for the classification of branched Galois covers of a curve $X$ focused on studying Galois ring extensions of its geometric adele ring $\A_{X}$. As an application, we deal with cyclic covers; namely, we…
We study the space of "link maps": the space of maps of a disjoint union of compact, closed manifolds P_1, . . ., P_k into a manifold N whose images are pairwise disjoint. We apply the manifold calculus of functors developed by Goodwillie…
This note shows how quantum entanglement may be simulated in classical computing. The simulated entanglement protocol is implemented using oblivious transfer in the simplest case and other many-to-one mappings in more general cases. For the…
An oriented connected closed manifold $M^n$ is called a URC-manifold if for any oriented connected closed manifold $N^n$ of the same dimension there exists a nonzero degree mapping of a finite-fold covering $\widehat{M}^n$ of $M^n$ onto…
Every link diagram can be represented as a signed ribbon graph. However, different link diagrams can be represented by the same ribbon graphs. We determine how checkerboard colourable diagrams of links in real projective space, and virtual…
This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…
A partial edge drawing (PED) of a graph is a variation of a node-link diagram. PED draws a link, which is a partial visual representation of an edge, and reduces visual clutter of the node-link diagram. However, more time is required to…
A concept of a rectangular diagram of a foliation in the three-sphere is introduced. It is shown that any co-orientable finite depth foliation in the complement of a link admits a presentation by a rectangular diagram compatible with the…
We study quasi-cyclic codes of index 2 over finite fields. We give a classification of such codes. Their duals with respect to the Euclidean, symplectic and Hermitian inner products are investigated. We describe self-orthogonal and…
The arrow polynomial is an invariant of framed oriented virtual links that generalizes the virtual Kauffman bracket. In this paper we define the homological arrow polynomial, which generalizes the arrow polynomial to framed oriented virtual…
We introduce a quandle invariant of classical and virtual links, denoted $Q_{tc} (L)$. This quandle has the property that $Q_{tc} (L) \cong Q_{tc} (L')$ if and only if the components of $L$ and $L'$ can be indexed in such a way that $L=K_1…
Evolution of large scale networks demand for efficient way of communication in the networks. One way to propagate information in the network is to find vertex cover. In this paper we describe a variant of vertex cover problem naming it…
For each m>=1 and k>=2, we construct a graph G=(V,E) with \omega(G)=m such that max_{1\leq i\leq k} \omega(G[V_i])=m for arbitrary partition V=V_1\cup...\cup V_k, where \omega(G) is the clique number of G and G[V_i] is the induced subgraph…
An important question in the study of quasi-perfect codes is whether such codes can be constructed for all possible lengths $n$. In this paper, we address this question for specific values of $n$. First, we investigate the existence of…
We show that every $2$-connected cubic graph $G$ has a cycle double cover if $G$ has a spanning subgraph $F$ such that (i) every component of $F$ has an even number of vertices (ii) every component of $F$ is either a cycle or a subdivision…
Flat virtual links are some variant of links, and semiquandles are counterparts of quandles or biquandles, which axiomize the Reidemeister-like moves. In this paper, we give some example of semiquandle and introduce an invariant for flat…
An MV-module is an MV-algebra endowed with a scalar multiplication with scalars in a PMV-algebra (i.e. an MV-algebra endowed with a binary "ring-like" product). We investigate the class of semisimple MV-modules over a semisimple and totally…
Graph embedding is the major technique which is used to map guest graph into host graph. In architecture simulation, graph embedding is said to be one of the strongest application for the execution of parallel algorithm and simulation of…