Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · May 199319922001200920182026
48 results for unknotted component

We show that there are links whose individual components are concordant to the unknot, but which are not concordant to any link with unknotted components. We give examples in the topological category, and examples in the smooth category which are topologically slice. We also give generalizations regarding components of…

2011-03-12abs ↗pdf ↗

We prove the perhaps surprising result that given any three polygonal unknots in R3\R^3, then we may form the Borromean rings out of them through rigid motions of R3\R^3 applied to the individual components together with possible scaling of the components. We also prove that if at least two of the unknots are planar, t…

2014-06-12abs ↗pdf ↗

It is shown that any closed three-manifold M obtained by integral surgery on a knot in the three-sphere can always be constructed from integral surgeries on a 3-component link L with each component being an unknot in the three-sphere. It is also interesting to notice that infinitely many different integral surgeries on…

2008-01-22abs ↗pdf ↗

We describe a method for generating minimal hard prime surface-link diagrams. We extend the known examples of minimal hard prime classical unknot and unlink diagrams up to three components and generate figures of all minimal hard prime surface-unknot and surface-unlink diagrams with prime base surface components up to …

2017-06-28abs ↗pdf ↗

Using unknotting number, we introduce a link diagram invariant of Hass and Nowik type, which changes at most by 2 under a Reidemeister move. As an application, we show that a certain infinite sequence of diagrams of the trivial two-component link need quadratic number of Reidemeister moves for being unknotted with resp…

2010-12-18abs ↗pdf ↗

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…

2012-06-27abs ↗pdf ↗

Combinatorial two-player games have recently been applied to knot theory. Examples of this include the Knotting-Unknotting Game and the Region Unknotting Game, both of which are played on knot shadows. These are turn-based games played by two players, where each player has a separate goal to achieve in order to win the…

2018-07-29abs ↗pdf ↗

Theory is developed for linear-quadratic at infinity generating families for Legendrian knots in R^3. It is shown that the unknot with maximal Thurston--Bennequin invariant of -1 has a unique linear-quadratic at infinity generating family, up to fiber-preserving diffeomorphism and stabilization. From this, invariant ge…

2009-04-17abs ↗pdf ↗

The paper classifies virtual links using the arc shift operation.

problem Classifying \( n \)-component virtual links up to arc shift equivalence.
method Established the arc shift operation as an unknotting tool for \( n \)-homogeneous proper virtual links, explored its connection to the odd writhe, and identified sequences with specific arc shift bounds.
result Identified sequences of virtual link diagrams \( L_n \) with an upper bound of arc shift number equal to \( n \).

We construct and prove a diagrammatic version of the Duflo isomorphism between the invariant subalgebra of the symmetric algebra of a Lie algebra and the center of the universal enveloping algebra. This version implies the original for metrized Lie algebras (Lie algebras with an invariant non-degenerate bilinear form).…

2000-06-11abs ↗pdf ↗

In this paper we compute the sharp lower bounds for the crossing number of nn-string kk-loop essential tangles. For essential tangles with only string components, we characterise the ones with the minimum crossing number for a given number of components, both when the tangle has knotted strings or only unknotted stri…

2015-05-27abs ↗pdf ↗

The paper studies unlinking links with minimal crossing changes.

problem Unlinking links with minimal changes when crossings between components are fixed.
method Examined minimum number of crossing changes for links with linking number zero and unknotted components.
result Data and general results about asymmetry of unlinking between components for links with up to ten crossings.

We show that the following unlinking strategy does not always yield an optimal sequence of crossing changes: first split the link with the minimal number of crossing changes, and then unknot the resulting components.

2014-10-08abs ↗pdf ↗

In a recent work of Ayaka Shimizu[5]^{[5]}, she defined an operation named region crossing change on link diagrams, and showed that region crossing change is an unknotting operation for knot diagrams. In this paper, we prove that region crossing change on a 2-component link diagram is an unknotting operation if and only…

2011-01-06abs ↗pdf ↗

We prove that deciding if a diagram of the unknot can be untangled using at most kk Riedemeister moves (where kk is part of the input) is NP-hard. We also prove that several natural questions regarding links in the 33-sphere are NP-hard, including detecting whether a link contains a trivial sublink with nn componen…

2018-10-08abs ↗pdf ↗

Three disjoint rays in euclidean 3-space form Borromean rays provided their union is knotted, but the union of any two components is unknotted. We construct infinitely many Borromean rays, uncountably many of which are pairwise inequivalent. We obtain uncountably many Borromean hyperplanes.

2012-11-27abs ↗pdf ↗

It was shown by Jim Davis that a 2-component link with Alexander polynomial one is topologically concordant to the Hopf link. In this paper, we show that there is a 2-component link with Alexander polynomial one that has unknotted components and is not smoothly concordant to the Hopf link, answering a question of Jim D…

2010-12-09abs ↗pdf ↗

Let P be a knot in an unknotted solid torus (i.e. a satellite operator or pattern), K a knot in S^3 and P(K) the satellite of K with pattern P. For any satellite operator P, this correspondence gives a function P : C -> C on the set of smooth concordance classes of knots. We give examples of winding number one satellit…

2014-03-16abs ↗pdf ↗

We show that all nontrivial embeddings of planar graphs on the torus contain a nontrivial knot or a nonsplit link. This is equivalent to showing that no minimally knotted planar spatial graphs on the torus exist that contain neither a nontrivial knot nor a nonsplit link all of whose components are unknots.

2014-11-28abs ↗pdf ↗

Study categorizes knots and links as rigid or shaky based on Reidemeister moves.

problem Classifying knots and links as rigid or shaky based on adaptability to Reidemeister moves.
method Categorization of hard diagrams as rigid or shaky, investigation of rigid and shaky hard diagrams for specific knots and links.
result Every link has a rigid hard diagram, and there is an upper limit for the number of crossings in such diagrams.

If L_1 and L_2 are two Brunnian links with all pairwise linking numbers 0, then we show that L_1 and L_2 are equivalent if and only if they have homeomorphic complements. In particular, this holds for all Brunnian links with at least three components. If L_1 is a Brunnian link with all pairwise linking numbers 0, and t…

1999-12-01abs ↗pdf ↗

We prove that if an alternating knot has unknotting number one, then there exists an unknotting crossing in any alternating diagram. This is done by showing that the obstruction to unknotting number one developed by Greene in his work on alternating 3-braid knots is sufficient to identify all unknotting number one alte…

2013-12-04abs ↗pdf ↗

RL pipeline simplifies knot diagrams, including very hard unknots.

problem Simplifying complex knot diagrams, especially very hard unknots.
method Reinforcement learning for move proposals and heuristic navigation of Reidemeister moves.
result Trained agent simplifies diagrams, including a 41#9104_1\#9_{10} link to a three-step unknotting process.