arXiv research

The paper explores when specific knot operations simplify diagrams.

Gordian complex of knots was defined by Hirasawa and Uchida as the simplicial complex whose vertices are knot isotopy classes in $\mathbb{S}^3$. Later Horiuchi and Ohyama defined Gordian complex of virtual knots using $v$-move and forbidden moves. In this paper we discuss Gordian complex of knots by region crossing cha…

We analyze all monodromies of genus one fibered knots that possess clean or once-unclean arcs, and use this to determine all manifolds containing genus one fibered knots with generalized crossing changes resulting in another genus one fibered knot, and classify all such generalized crossing changes between two genus on…

We characterize cutting arcs on fiber surfaces that produce new fiber surfaces, and the changes in monodromy resulting from such cuts. As a corollary, we characterize band surgeries between fibered links and introduce an operation called Generalized Hopf banding. We further characterize generalized crossing changes bet…

For any knot with genus one and unknotting number one, other than the figure-eight knot, we prove that there is exactly one way to unknot it by means of a crossing change. In the case of the figure-eight knot, we prove that there are precisely two unknotting crossing changes. The proof uses sutured manifold theory and …

It is known that the arc index of alternating knots is the minimal crossing number plus two and the arc index of prime nonalternating knots is less than or equal to the minimal crossing number. We study some cases when the arc index is strictly less than the minimal crossing number. We also give minimal grid diagrams o…

Listed 19,513 prime knots with arc index 12-16.

Minimal grid diagrams for 15,735 knots with 14 crossings and arc index 14.

Minimal grid diagrams found for 13-crossing prime knots with 13 arc index.

Minimal grid diagrams found for 13-crossing prime knots.

The study improves inequalities for link diagrams and introduces weak rectangular diagrams.

Given a reduced alternating diagram for a link, we obtain conditions that guarantee that the link complement has a complete hyperbolic structure, crossing arcs are the edges of an ideal geodesic triangulation, and every crossing arc is isotopic to a simple geodesic. The latter was conjectured by Sakuma and Weeks in 199…

Study links' arc index and Turaev genus, proving conjectures.

Every knot can be embedded in the union of finitely many half planes with a common boundary line in such a way that the portion of the knot in each half plane is a properly embedded arc. The minimal number of such half planes is called the arc index of the knot. We have identified all prime knots with arc index up to 1…

The paper provides bounds for the ropelength of a link in terms of the crossing numbers of its split components. As in earlier papers, the bounds grow with the square of the crossing number; however, the constant involved is a substantial improvement on previous results. The proof depends essentially on writing links i…

The paper describes topological properties of arcs and crossings in knot theory.

Bae and Park found an upper bound on the arc index of prime links in terms of the minimal crossing number. In this paper, we extend the definition of the arc presentation to spatial graphs and find an upper bound on the arc index $α(G)$ of any spatial graph $G$ as $α(G) \leq c(G)+e+b,$ where $c(G)$ is the minimal cro…

We discuss the relation between arc index, maximal Thurston--Bennequin number, and Khovanov homology for knots. As a consequence, we calculate the arc index and maximal Thurston--Bennequin number for all knots with at most 11 crossings. For some of these knots, the calculation requires a consideration of cables which a…

Generalizes meander diagrams to virtual knots and introduces new invariants.

We characterize planar diagrams which may be divided into n arc embeddings in terms of their chord diagrams, generalizing a result of Taniyama for the case n = 2. Two algorithms are provided, one which finds a minimal arc embedding (in quadradic time in the number of crossings), and one which constructs a minimal subdi…

This paper calculates stick numbers for rail arcs and knot classes.

For the alternating knots or links, mutations do not change the arc index. In the case of nonalternating knots, some semi-alternating knots or links have this property. We mainly focus on the problem of mutation invariance of the arc index for nonalternating knots which are not semi-alternating. In this paper, we found…

We computed the arc index for some of the pretzel knots $K=P(-p,q,r)$ with $p,q,r\ge2$, $r\geq q$ and at most one of $p,q,r$ is even. If $q=2$, then the arc index $α(K)$ equals the minimal crossing number $c(K)$. If $p\ge3$ and $q=3$, then $α(K)=c(K)-1$. If $p\ge5$ and $q=4$, then $α(K)=c(K)-2$.

In this paper, we introduce a bisected vertex leveling of a plane graph. Using this planar embedding, we present elementary proofs of the well-known upper bounds in terms of the minimal crossing number on braid index $b(L)$ and arc index $α(L)$ for any knot or non-split link $L$, which are $b(L) \leq \frac{1}{2} c(L) +…

Core groups are link invariants defined by arc or region presentations.

Rectangular diagrams of links are link diagrams in the plane ${\mathbb R}^2$ such that they are composed of vertical line segments and horizontal line segments and vertical segments go over horizontal segments at all crossings. P. R. Cromwell and I. A. Dynnikov showed that rectangular diagrams of links are useful for d…

Method for computing Khovanov homology of tangles.

Virtual index cocycles reformulate virtual link invariants.

The paper establishes a relation between knotoid crossing number and height.

Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface with any genus and number of boundary components. If only bigons are allowed, t…

We introduce a local move on a link diagram named a region freeze crossing change which is close to a region crossing change, but not the same. We study similarity and difference between region crossing change and region freeze crossing change.

New parities defined on virtual knots linked to crossing indices.

Recent reports have described that the equivalent sample size (ESS) in a Dirichlet prior plays an important role in learning Bayesian networks. This paper provides an asymptotic analysis of the marginal likelihood score for a Bayesian network. Results show that the ratio of the ESS and sample size determine the penalty…

A Morse 2-function is a generic smooth map from a manifold M of arbitrary finite dimension to a surface B. Its critical set maps to an immersed collection of cusped arcs in B. The aim of this paper is to explain exactly when it is possible to move these arcs around in B by a homotopy and to give a library of examples w…

Paper classifies link diagrams on nonorientable surfaces using region crossing changes.

Online method selects candidates from data streams, ensuring irreversible decisions.

Region crossing change is a local operation on link diagrams. The behavior of region crossing change on $S^2$ is well understood. In this paper, we study the behavior of (modified) region crossing change on higher genus surfaces.

Alexander polynomial condition blocks crossing changes in some knots.

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.

We introduce the polygonalisation complex of a surface, a cube complex whose vertices correspond to polygonalisations. This is a geometric model for the mapping class group and it is motivated by works of Harer, Mosher and Penner. Using properties of the flip graph, we show that the midcubes in the polygonalisation com…

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

Let $X$ be a simplicial complex with a piecewise linear function $f:X\to\mathbb{R}$. The Reeb graph $Reeb(f,X)$ is the quotient of $X$, where we collapse each connected component of $f^{-1}(t)$ to a single point. Let the nodes of $Reeb(f,X)$ be all homologically critical points where any homology of the corresponding c…

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…

Study examines how changing regions affects planar graphs.

A crossing in a knot is nugatory if changing the crossing does not change the knot type. Using an invariant of certain types of closed 3-braid diagrams, we show that if a closed 3-braid contains a nugatory crossing then its braid index is one or two. This proves a special case of a conjecture on nugatory crossings due …

We show that if K is a satellite knot which admits a generalized cosmetic crossing change of order q with |q| \geq 6, then K admits a pattern knot with a generalized cosmetic crossing change of the same order. As a consequence of this, we find that any prime satellite knot which admits a pattern knot that is fibered ca…

Proves special alternating knots can't have cosmetic crossings.

Shows large unknotting number for simple knots.