Two links are link-homotopic if they are transformed into each other by a sequence of self-crossing changes and ambient isotopies. The link-homotopy classes of 4-component links were classified by Levine with enormous algebraic computations. We modify the results by using Habiro's clasper theory. The new classification…
The paper classifies links up to link-homotopy using claspers.
problem Classifying links up to link-homotopy.
method Using Habiro's clasper calculus, defining a linear representation of the homotopy braid group, and providing a geometric proof.
result Geometric proof of Levine's classification of 4-component links and further classification of 5-component links in the algebraically split case.
We realize a given (monic) Alexander polynomial by a (fibered) hyperbolic arborescent knot and link of any number of components, and by infinitely many such links of at least 4 components. As a consequence, a Mahler measure minimizing polynomial, if it exists, is realized as the Alexander polynomial of a fibered hyperb…
The paper calculates actions of string link operations for 4- and 5-component links.
problem Classifying link-homotopy classes of string links.
method Explicit calculation of actions of partial conjugations and conjugations for 4- and 5-component string links.
result Presentations of link-homotopy classes for 4- and 5-component links.
Following an example discovered by John Berge, we show that there is a 4-component link L \subset (S^1 x S^2)#(S^1 x S^2) so that, generically, the result of Dehn surgery on L is a 3-manifold with two inequivalent genus 2 Heegaard splittings, and each of these Heegaard splittings is of Hempel distance 3.
Fleming and Foisy recently proved the existence of a digraph whose every embedding contains a 4-component link, and left open the possibility that a directed graph with an intrinsic n-component link might exist. We show that, indeed, this is the case. In fact, much as Flapan, Mellor, and Naimi show for graphs, knot…
J.-B. Meilhan and the second author showed that any Milnor μˉ-invariant of length between 3 and 2k+1 can be represented as a combination of HOMFLYPT polynomial of knots obtained by certain band sum of the link components, if all μˉ-invariants of length ≤k vanish. They also showed that their formula do…
We analyze four-dimensional symplectic manifolds of type X=S1×M3 where M3 is an open 3-manifold admitting inequivalent fibrations leading to inequivalent symplectic structures on X. For the case where M3⊂S3 is the complement of a 4-component link constructed by McMullen-Taubes, we provid…
This paper improves bounds on how many Delta-moves are needed to trivialize a link.
problem Counting the minimum number of Delta-moves to make a link homotopy trivial.
method Classification of link homotopy and extremal graph theory.
result Quadratic and cubic upper bounds on the homotopy trivializing numbers of links.
New examples show limits of physical link isotopies.
problem Limits of physical link isotopies in thick and thickly embedded links.
method Construction of specific examples of thick and thickly embedded links.
result Explicit examples of links that cannot be split through thick homotopies.
The study finds counterexamples to a conjecture about incompressible planar surfaces in hyperbolic link exteriors.
problem Finding counterexamples to a conjecture about incompressible planar surfaces in hyperbolic link exteriors.
method Constructing examples of hyperbolic links and analyzing their exteriors to find incompressible spanning planar surfaces.
result Examples of 3-component hyperbolic links with exterior containing incompressible spanning planar surfaces with nonmeridional and nonintegral boundary slopes.
We make a new attempt at the recently suggested program to express knot polynomials through topological vertices, which can be considered as a possible approach to the tangle calculus: we discuss the Macdonald deformation of the relation between the convolution of two topological vertices and the HOMFLY-PT invariant of…
The study optimizes supply chain management through a dice-based model to predict cleaner production.
problem Uncertainty in supply chain management and economic predictions.
method A 4-component SC module (environmental, demand, economic, social uncertainties) ranked by weight, using Analytical Hierarchical Process and optimization of a weighted cost function.
result Identifies conditions validating the sustainability of a business venture and optimizes market uncertainty.
Model predicts time evolution of supply chain networks under varying costs.
problem Regulating downstream relationships for sustainable SMEs.
method Time varying SCN model based on Lagrangian mechanics, incorporating EDES cost kernels.
result Model predicts bankruptcy and break-even states under different cost scenarios.
Deep forecasting models show output heads significantly improve performance on fat-tailed financial returns.
problem Improving deep learning models for forecasting fat-tailed financial returns.
method Comparison of backbone architectures and output heads (point, Gaussian, Gaussian mixture) on S&P 500 monthly log-returns.
result Switching from point to Gaussian heads improves CRPS by about 1.3 percent, and from Gaussian to mixture adds another 2.4 percent.
Study proves chainmail links are L-space links.
problem Understanding L-space links in chainmail links.
method Inspired by alternating links, uses flat augmentation.
result Proves alternating chainmail links are L-space links.
New findings on T-links derived from torus links.
problem Difficulty in determining geometric type of T-links.
method Examined T-links obtained by full twists along torus links.
result T-links obtained by full twists are not torus links.
Classifies colored links and spatial graphs up to colored link-homotopy.
problem Classifying colored links and spatial graphs up to colored link-homotopy.
method Using Habegger-Lin theory for colored string links, and extending to colored links and spatial graphs.
result Classification of colored links and spatial graphs up to colored link-homotopy.
Paper finds linking numbers for Montesinos links using a simple algorithm.
problem Calculating linking numbers for Montesinos links.
method Simple proof and numerical algorithm for rational links, extending to Montesinos links.
result Linking numbers found for any two components in Montesinos links.
We define and prove properties of link lattice complexes for plumbed links.
problem Understanding the homology and formality of plumbed L-space links.
method Define and analyze link lattice complexes, proving homotopy equivalence and formality properties.
result Link lattice complexes are homotopy equivalent to link Floer complexes for plumbed links.
Study of Lorenz links and T-links, showing equivalence and unique presentations.
problem Understanding equivalence and uniqueness of T-link presentations for Lorenz links.
method Minimal-braid approach, V-link braids, T-link parameters, geometric type criteria.
result Explicit correspondence between V-links and T-links, criteria for equivalence and uniqueness.
Paper proves Reshetikhin-Turaev link invariants appear in higher order terms of re-normalized link invariants for plumbed links.
problem Proving relations between Reshetikhin-Turaev and re-normalized link invariants for links.
method Analyzing higher order terms of re-normalized link invariants for plumbed links.
result Reshetikhin-Turaev link invariants appear in higher order terms of re-normalized link invariants for plumbed links.
Extends positive and almost positive links to successively almost positive ones.
problem Extending properties of positive and almost positive diagrams and links.
method Introducing successively almost positive diagrams and links, and analyzing their properties.
result Improves known results of positive and almost positive links.
Study of knots and links in 2-complexes, defining linking numbers and polynomials.
problem Understanding knots and links in 2-dimensional complexes.
method Definition of linking numbers and Kauffman-type bracket polynomials for links in 2-complexes.
result Established relationships between 2-complexes and knots/links in 3-manifolds.
A virtual link is a generalization of a classical link that is defined as an equivalence class of certain diagrams, called virtual link diagrams. It is further generalized to a twisted link. Twisted links are in one-to-one correspondence with stable equivalence classes of links in oriented thickenings of (possibly non-…
We generalized the periodic links to \emph{transitive} links in a 3-manifold M. We find a complete classification theorem of transitive links in a 3-dimensional sphere R3. We study these links from several different aspects including polynomial invariants using the relation between link polynomials of…
Characterizes a subset of links using quasipositive and homogeneous properties.
problem Understanding the properties of T-positive links.
method Characterization through strongly quasipositive and T-homogeneous braids.
result T-positive links are precisely the strongly quasipositive links that are closures of T-homogeneous braids.
Study links' flat-virtual diagrams to create link invariants.
problem Equivalence and invariants of flat-virtual diagrams.
method Maps from links in thickened surfaces to flat-virtual links.
result Investigation of flat-virtual diagrams' equivalence and invariants.
New link invariants from diagram colorings match link widths.
problem Defining link widths via diagram colorings.
method Colorings of link diagrams to define invariants and prove their equivalence to link widths.
result Invariants of link widths calculated algorithmically.
Innovates a three-component link homotopy invariant.
problem Classifying three-component link maps up to homotopy.
method Developed tools and invariants for distinguishing three-component link maps.
result Found three-component link maps that are not homotopic.
Enhanced Alexander module detects linking numbers in links.
problem Detecting linking numbers in links using Alexander modules.
method Defining and singling out meridians and longitudes in reduced Alexander modules.
result The enhanced Alexander module determines all linking numbers.
The theory of signature invariants of links in rational homology spheres is applied to covering links of homology boundary links. From patterns and Seifert matrices of homology boundary links, an explicit formula is derived to compute signature invariants of their covering links. Using the formula, we produce fused bou…
New methods show hyperbolicity of Brunnian links.
problem Determining hyperbolicity of Brunnian links.
method Geometric/combinatorial topology techniques applied to links with at least one unknotted component.
result Determine hyperbolicity for all Brunnian links.
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link d…
Link Floer homology detects split links.
problem Detecting split links in link Floer homology.
method Module structure on link Floer homology and sutured Floer homology results.
result Link Floer homology detects split links.
New link types derived from old links.
problem Understanding the structure of modular links.
method Analyzing the complements of arithmetic modular links and comparing them to augmented chainlinks.
result Arithmetic modular links are homeomorphic to augmented chainlinks.
Twisted torus links are given by twisting a subset of strands on a closed braid representative of a torus link. T--links are a natural generalization, given by repeated positive twisting. We establish a one-to-one correspondence between positive braid representatives of Lorenz links and T--links, so Lorenz links and T-…
This report lists the link diagrams in S^3 for all principal congruence link complements for which such a link diagram is known. Several unpublished link diagrams are included. Related to this, we also include one link diagram for an arithmetic regular tessellation link complement.
Extends Benard-Conway invariant to all two-component links.
problem Counting irreducible SU(2) representations for two-component links.
method Counting irreducible SU(2) representations with fixed meridional traces.
result Invariant equals symmetrized multivariable link signature for (2, 2n)-torus links.
The paper extends CF-moves to classify virtual links of any number of components.
problem Classifying virtual links using CF-moves.
method Extending CF-moves to classify virtual links of arbitrary number of components using the virtual linking number and invariants.
result Classification of 3-component even virtual links up to CF-moves.
The paper confirms a conjecture and extends arrow polynomial to twisted links.
problem Extending classical invariants to virtual and twisted links.
method Checkerboard framings, cut points, and normalized arrow polynomial.
result The normalized arrow polynomial is an invariant for twisted links.
New obstructions show links with vanishing Milnor invariants may not be concordant to homology boundary links.
problem Understanding links with vanishing Milnor invariants and their concordance properties.
method Developing new obstructions and examples within the solvable filtration framework.
result Existence of links with vanishing Milnor invariants that are not concordant to homology boundary links.
It is shown that any handle-irreducible summand of every stable-ribbon surface-link is a unique ribbon surface-link up to equivalences, so that every stable-ribbon surface-link is a ribbon surface-link. This is a generalization of a previously observed result for a stably trivial surface-link. Two observations are give…
Researchers compute link surgery modules for 2-component L-space links.
problem Computing the link surgery modules of 2-component L-space links.
method Koszul duality to extend earlier computations.
result Computed entire link surgery modules modulo a technical result.
We show that if a split link is obtained from a split link L in S3 by 1/n-Dehn surgery along a trivial knot C, then the link L∪C is splittable. That is to say, it is impossible to obtain a split link from a split link via a non-trivial twisting. As its corollary, we completely determine when a trivial li…
Paper proves link diagrams can be realized for some but not all types of links.
problem Realizing link diagrams for different types of links.
method Analyzing link diagrams for welded and virtual links.
result Similar results hold for welded links but not for virtual links.
Given an m-component link L in S3 (m≥2), we construct a family of links which are link homotopic, but not link isotopic, to L. Every proper sublink of such a link is link isotopic to the corresponding sublink of L. Moreover, if L is an unlink then there exist links that in addition to the above prope…
Study links' arc index and Turaev genus, proving conjectures.
problem Understanding the arc index and Turaev genus of links.
method Computed arc index, established bounds, and conjectured inequalities.
result Proved conjectures linking crossing number, arc index, and Turaev genus.