相关论文: Crosscap Numbers of Two-component Links

We define a new kind of crossing number which generalizes both the bipartite crossing number and the outerplanar crossing number. We calculate exact values of this crossing number for many complete bipartite graphs and also give a lower…

The component connectivity is the generalization of connectivity which is an parameter for the reliability evaluation of interconnection networks. The $g$-component connectivity $c\kappa_{g}(G)$ of a non-complete connected graph $G$ is the…

Twisted links are a generalization of virtual links. As virtual links correspond to abstract links on orientable surfaces, twisted links correspond to abstract links on (possibly non-orientable) surfaces. In this paper, we introduce the…

It is well-known that all 2-knots are slice. Are all 2-links slice? This is an outstanding open question. In this paper we prove the following: For any 2-component 2-link (J,K)in the 4-sphere which bounds the 5-ball B^5, there is an…

Quasi-alternating links of determinant 1, 2, 3, and 5 were previously classified by Greene and Teragaito, who showed that the only such links are two-bridge. In this paper, we extend this result by showing that all quasi-alternating links…

For any link in the 3-sphere, there is a natural lower bound for the unlinking number in terms of the classical signature. We prove that if this lower bound is sharp for a special alternating link $L$, then the unlinking number of $L$ is…

We specify the computational complexity of crosscap numbers of alternating knots by introducing an automatic computation. For an alternating knot $K$, let $\cal{E}$ be the number of edges of its diagram. Then there exists a code such that…

For any n\ge 2, we give infinitely many unsplittable links of n components in the 3-sphere which admit non-trivial surgery yielding the 3-sphere again and whose components are mutually distinct hyperbolic knots. Berge and Kawauchi gave…

A bipartite quantum state (for two systems in any dimensions) can be decomposed as a superposition of many components. For a superposition of more than two components we prove that there is a bound of the entanglement of the superposition…

We consider systems of simple closed curves on surfaces and their total number of intersection points, their so-called crossing number. For a fixed number of curves, we aim to minimise the crossing number. We determine the minimal crossing…

The Wirtinger number of a virtual link is the minimum number of generators of the link group over all meridional presentations in which every relation is an iterated Wirtinger relation arising in a diagram. We prove that the Wirtinger…

We provide an algorithm to determine whether a link L admits a crossing change that turns it into a split link, under some fairly mild hypotheses on L. The algorithm also provides a complete list of all such crossing changes. It can…

If the tunnel number of a link $K$ is denoted $t(K)$, a pair of knots $K_1,K_2$ is said to be subadditive if $t(K_1)+t(K_2)>t(K_1 # K_2)$. We construct new examples of subadditive links.

We study simplicial complexes with a given number of vertices whose Stanley-Reisner ring has the minimal possible Betti numbers. We find that these simplicial complexes have very special combinatorial and topological structures. For…

A quadruple crossing is a crossing in a projection of a knot or link that has four strands of the knot passing straight through it. A quadruple crossing projection is a projection such that all of the crossings are quadruple crossings. In a…

Wirtinger presentations of deficiency 1 appear in the context of knots, long virtual knots, and ribbon 2-knots. They are encoded by (word) labeled oriented trees and, for that reason, are also called LOT presentations. These presentations…

In an earlier note [arXiv:2301.00295] it was shown that there is an upper bound to the number of disjoint Hopf links (and certain related links) that can be embedded in the unit cube where there is a fixed separation required between the…

We consider a set of cliques in any multipartite graph with two vertices in each part. Moreover, we construct a class of peculiar polytopes. Key words: multipartite graph, clique, polytope.

When particles interact via two-body short-range central potential wells, binding can occur for some critical values of the coupling constants. Using the envelope theory, upper bounds for critical coupling constants are computed for quantum…

We show there exists a linear embedding of $K_{3,3,1}$ with n nontrivial 2-component links if and only if n = 1, 2, 3, 4, or 5.