Related papers: Identification of 2-bridge links

Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…

We prove that for 2-bridge knots, the diameter, D, of the set of boundary slopes is twice the crossing number, c. This constitutes partial verification of a conjecture that, for all knots in S^3, D is at most 2c.

Using exhaustive techniques and results from Lackenby and many others, we compute the tunnel number of all 1655 alternating 11 and 12 crossing knots and of 881 non-alternating 11 and 12 crossing knots. We also find all 5525 Montesinos knots…

The splitting number of a link is the minimum number of crossing changes between distinct components that is required to convert the link into a split link. We provide a bound on the splitting number in terms of the four-genus of related…

We give a variation of McShane's identity, which describes the cusp shape of a hyperbolic 2-bridge link in terms of the complex translation lengths of simple loops on the bridge sphere. We also explicitly determine the set of end invariants…

Among all simple 2-connected graphs, and among all $\theta$-graphs, the graphs with the minimum algebraic connectivity are completely determined, respectively.

Computing unlinking number is usually very difficult and complex problem, therefore we define BJ-unlinking number and recall Bernhard-Jablan conjecture stating that the classical unknotting/unlinking number is equal to the BJ-unlinking…

In this paper, we give a simple proof for the small cancellation conditions of the upper presentations of 2-bridge link groups, which holds the key to the proof of the main result of [1]. We also give an alternative proof of the main result…

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…

We enumerate all genus two handlebody-knots with seven crossings, up to mirror image, extending the Ishii-Kishimoto-Moriuchi-Suzuki table.

In this paper, we show that any unknotting tunnel for a two bridge knot is isotopic to either one of known ones. This together with Morimoto-Sakuma's result gives the complete classification of unknotting tunnels for two bridge knots up to…

We define the {\it Wirtinger number} of a link, an invariant closely related to the meridional rank. The Wirtinger number is the minimum number of generators of the fundamental group of the link complement over all meridional presentations…

An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…

We prove the meridional rank conjecture for arborescent links associated to plane trees with the following property: all branching points carry a straight branch to at least three leaves. The proof involves an upper bound on the bridge…

With the idea of an eventual classification of 3-bridge links,\ we define a very nice class of 3-balls (called butterflies) with faces identified by pairs, such that the identification space is $S^{3},$ and the image of a prefered set of…

In this paper we study further when tangles embed into the unknot, the unlink or a split link. In particular, we study obstructions to these properties through geometric characterizations, tangle sums and colorings. As an application we…

We give the bridge indices for 11-crossing prime knots and give a minimal bridge projection for each of these knots. The results on the indices may be easily summarized: all of these knots that are not rational knots or Montesinos knots…

The identification of nodes occupying important positions in a network structure is crucial for the understanding of the associated real-world system. Usually, betweenness centrality is used to evaluate a node capacity to connect different…

We prove Riley's conjecture on the number of parabolic SL(2,R) representations of 2-bridge knot groups.

We publish a table of primitive finite-type invariants of order less than or equal to six, for knots of ten or fewer crossings. We note certain mod-2 congruences, one of which leads to a chirality criterion in the Alexander polynomial. We…