arXiv research

Paper finds linking numbers for Montesinos links using a simple algorithm.

The triple linking number of an oriented surface link was defined as an analogical notion of the linking number of a classical link. We consider a certain $m$-component $T^2$-link ($m \geq 3$) determined from two commutative pure $m$-braids $a$ and $b$. We present the triple linking number of such a $T^2$-link, by usin…

In the 1950's Milnor defined a family of higher order invariants generalizing the linking number. Even the first of these new invariants, the triple linking number, has received and fruitful study since its inception. In the case that $L$ has vanishing pairwise linking numbers, this triple linking number gives an integ…

The paper examines linking numbers in grid models and finds polynomial moments.

Computed linking number of modular knots and Lorenz links.

New methods for delta-moves on algebraically split links identified.

Delta-unlinking number measures how to unlink algebraically split links.

The paper extends CF-moves to classify virtual links of any number of components.

The paper generalizes linking number properties for complete graphs.

Paper defines linking numbers for periodic tangles.

Characterizes adequate links using Jones polynomial and crossing number.

This paper improves bounds on how many Delta-moves are needed to trivialize a link.

Links with minimum tunnel number have one less component than their number of parts.

Enhanced Alexander module detects linking numbers in links.

The paper identifies all link projections with isolate-region number one.

In this paper we investigate the unlinking numbers of 10-crossing links. We make use of various link invariants and explore their behaviour when crossings are changed. The methods we describe have been used previously to compute unlinking numbers of links with crossing number at most 9. Ultimately, we find the unlinkin…

The minimal coloring number of a $\mathbb{Z}$-colorable link is the minimal number of colors for non-trivial $\mathbb{Z}$-colorings on diagrams of the link. In this paper, we show that the minimal coloring number of any non-splittable $\mathbb{Z}$-colorable links is four. As an example, we consider the link obtained by…

Study of knots and links in 2-complexes, defining linking numbers and polynomials.

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 links and Alexander invariants. As an application, we completely determine the sp…

New method finds infinitely many surface knots with specific bridge numbers.

The paper tabulates and computes the number of alternating pretzel links up to a given crossing number.

New measure shows how links can be untangled as twists increase.

The surgery unknotting number of a Legendrian link is defined as the minimal number of particular oriented surgeries that are required to convert the link into a Legendrian unknot. Lower bounds for the surgery unknotting number are given in terms of classical invariants of the Legendrian link. The surgery unknotting nu…

We define the crosscap number of a 2-component link as the minimum of the first Betti numbers of connected, non-orientable surfaces bounding the link. We discuss some properties of the crosscap numbers of 2-component links.

New proof for minimizing tunnel systems in satellite chain links.

The study calculates the average genus of rational knots and links.

Study sharpens unlinking number bounds for special alternating links.

For a link with zero determinants, a Z-coloring is defined as a generalization of Fox coloring. We call a link having a diagram which admits a non-trivial Z-coloring a Z-colorable link. The minimal coloring number of a Z-colorable link is the minimal number of colors for non-trivial Z-colorings on diagrams of the link.…

In the 1980's Daryl Cooper introduced the notion of a C-complex (or clasp-complex) bounded by a link and explained how to compute signatures and polynomial invariants using a C-complex. Since then this was extended by works of Cimasoni, Florens, Mellor, Melvin, Conway, Toffoli, Friedl, and others to compute other link …

Estimates how many times a star appears due to gravitational lensing.

Study on multiple linking numbers, extending Gauss diagram formulas.

Triple linking numbers were defined for 3-component oriented surface-links in 4-space using signed triple points on projections in 3-space. In this paper we give an algebraic formulation using intersections of homology classes (or cup products on cohomology groups). We prove that spherical links have trivial triple lin…

To each three-component link in the 3-sphere, we associate a geometrically natural characteristic map from the 3-torus to the 2-sphere, and show that the pairwise linking numbers and Milnor triple linking number that classify the link up to link homotopy correspond to the Pontryagin invariants that classify its charact…

Proves links can be simplified to trivial form in few changes, limiting Milnor's invariants.

As a generalization of the linking number, we construct a set of invariant numbers for two-component handlebody-links. These numbers are elementary divisors associated with the natural homomorphism from the first homology group of a component to that of the complement of another component.

New method calculates number of components in twisted torus links.

New formulas link Milnor invariants to Heegaard Floer homology.

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 knots.

A flat plumbing basket is a surface consisting a disk and finitely many bands which are contained in distinct pages of the trivial open book decomposition of $\mathbf{S}^{3}$. In this paper, we construct a Legendrian link from a flat plumbing basket, and we describe a relation among the self-linking number, the Thursto…

Calculates lower bounds for type III Reidemeister moves in link diagrams.

We give a refined value group for the collection of triple linking numbers of links in the 3-sphere. Given two links with the same pairwise linking numbers we show that they have the same refined triple linking number collection if and only if the links admit homeomorphic surface systems. Moreover these two conditions …

Random walks and polygons are used to model polymers. In this paper we consider the extension of writhe, self-linking number and linking number to open chains. We then study the average writhe, self-linking and linking number of random walks and polygons over the space of configurations as a function of their length. W…

Paper introduces new link homotopy invariants and applies them to 3-bouquet graphs.

K. Ichihara and E. Matsudo introduced the notions of $\mathbb{Z}$-colorable links and the minimal coloring number for $\mathbb{Z}$-colorable links, which is one of invariants for links. They proved that the lower bound of minimal coloring number of a non-splittable $\mathbb{Z}$-colorable link is 4. In this paper, we sh…

Given a clover link, we construct a bottom tangle by using a disk/band surface of the clover link. Since the Milnor number is already defined for a bottom tangle, we define the Milnor number for the clover link to be the Milnor number for the bottom tangle and show that for a clover link, if Milnor numbers of length k …

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 number of a virtual link equals its virtual bridge number. Since the Wirtinger number…

The study proves a conjecture about arborescent links with many twigs.

Study of generalized knots and links, proving inequality involving crossing number and braid index.