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.

168,742 papers · 148 categories

Trend · papers per month

122245367489 · Jun 202019922001200920172026
48 results for region unknotting number

In this paper, we discuss the region unknotting number of different classes of 2-bridge knots. In particular, we provide region unknotting number for the classes of 22-bridge knots whose Conway notation is C(m, n),C(m, 2, m),C(m,\ n), C(m,\ 2,\ m), C(m, 2, m±1) C(m,\ 2,\ m\pm1) and C(2, m, 2, n)C(2,\ m,\ 2,\ n). By generalizing, we also provide a sharp up…

2014-07-10abs ↗pdf ↗

In this paper, we formulate a new local move on virtual knot diagram, called arc shift move. Further, we extend it to another local move called region arc shift defined on a region of a virtual knot diagram. We establish that these arc shift and region arc shift moves are unknotting operations by showing that any virtu…

2018-08-13abs ↗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 ↗

Problems on region choices for knot and link diagrams solved using Alexander numbering.

problem Existence of solutions for region choice problems on knot and link diagrams.
method Alexander numbering for regions, alternative proofs, necessary and sufficient conditions.
result Existence of solutions for region choice problems on link diagrams.

In this paper, we prove that region crossing change on a link diagram is an unknotting operation if and only if the link is proper. A description of the behavior of region crossing change on link diagrams is given. Furthermore we also discuss the relation between region crossing change and the Arf invariant of proper l…

2012-01-09abs ↗pdf ↗

A region crossing change at a region of a spatial-graph diagram is a transformation changing every crossing on the boundary of the region. In this paper, it is shown that every spatial graph consisting of theta-curves can be unknotted by region crossing changes.

2019-10-27abs ↗pdf ↗

The UNKNOT problem solved using natural language processing and machine learning.

problem Determining if a knot is the unknot.
method Braid word representation, binary classification, Reformer and shared-QK Transformer networks, reinforcement learning, Markov moves, braid relations.
result Reformer and shared-QK Transformer networks outperform fully-connected networks in predicting the unknot.

In this paper we propose {\it a region choice problem} for a knot projection. This problem is an integral extension of Shimizu's 'region crossing change unknotting operation.' We show that there exists a solution of the region choice problem for all knot projections.

2012-01-22abs ↗pdf ↗

Spatial embeddings of planar graphs can have higher unknotting numbers than crossing numbers.

problem Understanding the relationship between unknotting numbers and crossing numbers of spatial embeddings of planar graphs.
method Analyzing specific examples of planar graphs and their spatial embeddings to find counterexamples.
result There exist planar graphs and their spatial embeddings where the unknotting number is greater than half the crossing number.

Determining unknotting numbers is a large and widely studied problem. We consider the more general question of the unknotting number of a spatial graph. We show the unknotting number of spatial graphs is subadditive. Let gg be an embedding of a planar graph GG, then we show u(g)max{u(s)u(g) \geq \max\{u(s) | ss is a non-overl…

2017-10-14abs ↗pdf ↗

The unknotting number is the classical invariant of a knot. However, its determination is difficult in general. To obtain the unknotting number from definition one has to investigate all possible diagrams of the knot. We tried to show the unknotting number can be obtained from any one diagram of the knot. To do this we…

2013-03-28abs ↗pdf ↗

This paper concerns the H(2)-unknotting numbers of links related to 2-bridge links. It consists of three parts. In the first part, we consider a necessary and sufficient condition for a 2-bridge link to have H(2)-unknotting number one. The second part concerns an explicit form of composite links with H(2)-unknotting nu…

2011-04-22abs ↗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 ↗

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

problem Understanding how links can be simplified through repeated twists.
method Introduced the stable unknotting number to analyze links in a twist family.
result The stable unknotting number depends only on the winding number of the link, not the wrapping number.

The virtual unknotting number of a virtual knot is the minimal number of crossing changes that makes the virtual knot to be the unknot, which is defined only for virtual knots virtually homotopic to the unknot. We focus on the virtual knot obtained from the standard (p,q)-torus knot diagram by replacing all crossings o…

2017-01-15abs ↗pdf ↗

The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. The algebraic unknotting number is the minimum number of crossing changes needed to transform a knot into an Alexander polynomial-one knot. We work with a generalization of unknotting number due to Math…

2015-07-15abs ↗pdf ↗

Study on knot properties, showing relation between unknotting and crossing numbers.

problem Relations between unknotting and crossing numbers of spatial embeddings.
method Analyzes handcuff-graphs and theta curves, extends known results to handlebody-knots.
result Characterizes handlebody-knots satisfying the equality between unknotting and crossing numbers.

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.

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 ↗

We use Heegaard Floer homology to obtain bounds on unknotting numbers. This is a generalisation of Ozsvath and Szabo's obstruction to unknotting number one. We determine the unknotting numbers of 9_10, 9_13, 9_35, 9_38, 10_53, 10_101 and 10_120; this completes the table of unknotting numbers for prime knots with crossi…

2005-06-23abs ↗pdf ↗

The unknotting number of a knot is bounded from below by its slice genus. It is a well-known fact that the genera and unknotting numbers of torus knots coincide. In this note we characterize quasipositive knots for which the genus bound is sharp: the slice genus of a quasipositive knot equals its unknotting number, if …

2008-09-01abs ↗pdf ↗

A knot in the 3-sphere is said to have zero negative unknotting number if it can be transformed into the unknot by performing only positive crossing changes. In this paper, we provide an obstruction for a knot to having zero negative unknotting number, and discuss its application to two classes of knots.

2016-04-07abs ↗pdf ↗

Spatial graphs of non-Eulerian or proper Eulerian planar graphs are unknottable by region crossing changes.

problem Unknottability of spatial graphs by region crossing changes.
method Region crossing changes to switch over/under relations within regions of spatial graph diagrams.
result Spatial graphs of non-Eulerian or proper Eulerian planar graphs are unknottable by region crossing changes.