It is shown that the projection image of an oriented spatial arc to any oriented plane is approximated by a unique arc diagram (up to isomorphic arc diagrams) determined from the spatial arc and the projection. In a separated paper, the knotting probability of an arc diagram is defined as an invariant under isomorphic …
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.
Trend · papers per month
NT probability measures knotting in 3D arc systems.
The paper explores when specific knot operations simplify diagrams.
Non-trivialization probability of arc system in 3D space
Solve arc diagrams on surfaces via branched covers.
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.
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…
The study improves inequalities for link diagrams and introduces weak rectangular diagrams.
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…
We study decomposition into simple arcs (i. e., arcs without self-intersections) for diagrams of knots and spatial graphs. In this paper, it is proved in particular that if no edge of a finite spatial graph is a knotted loop, then there exists a plane diagram of such that (i) each edge of is represented…
Listed 19,513 prime knots with arc index 12-16.
Minimal grid diagrams found for 13-crossing prime knots.
Generalizes meander diagrams to virtual knots and introduces new invariants.
The paper classifies virtual links using the arc shift operation.
The paper describes topological properties of arcs and crossings in knot theory.
We work with a generalization of knot theory, in which one diagram is reachable from another via a finite sequence of moves if a fixed condition, regarding the existence of certain morphisms in an associated category, is satisfied for every move of the sequence. This conditional setting leads to a possibility of irreve…
We demonstrate an isomorphism between the homology of the strand algebra of bordered Floer homology, and the category algebra of the contact category introduced by Honda. This isomorphism provides a direct correspondence between various notions of Floer homology and arc diagrams, on the one hand, and contact geometry a…
Core groups are link invariants defined by arc or region presentations.
We give a complete characterization of a circle immersion that can be divided into two arc embeddings in terms of its chord diagram.
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…
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…
Rectangular diagrams of links are link diagrams in the plane 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…
The paper proves a generalized Kauffman-Harary conjecture for prime determinant links.
We work on the notions of rail arcs and rail isotopy in , and we introduce the notions of rail knotoid diagrams and their equivalence. Our main result is that two rail arcs in are rail isotopic if and only if their knotoid diagram projections onto the plane of the two lines which we call ra…
We classify link diagrams with Turaev genus one and two in terms of an alternating tangle structure of the link diagram. The proof involves surgery along simple closed curves on the Turaev surface, called cutting loops, which have corresponding cutting arcs that are visible on the planar link diagram. These also provid…
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…
Gordian complex of knots was defined by Hirasawa and Uchida as the simplicial complex whose vertices are knot isotopy classes in . Later Horiuchi and Ohyama defined Gordian complex of virtual knots using -move and forbidden moves. In this paper we discuss Gordian complex of knots by region crossing cha…
We prove that any -colorable knot is presented by an -colored diagram where exactly five colors of eleven are assigned to the arcs. The number five is the minimum for all non-trivially -colored diagrams of the knot. We also prove a similar result for any -colorable ribbon -knot.
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 and arc index for any knot or non-split link , which are $b(L) \leq \frac{1}{2} c(L) +…
This article is about applications of linear algebra to knot theory. For example, for odd prime p, there is a rule (given in the article) for coloring the arcs of a knot or link diagram from the residues mod p. This is a knot invariant in the sense that if a diagram of the knot under study admits such a coloring, then …
Study on knots using 17 colors, finding specific color assignments.
Let be an -punctured sphere, with . We prove that is the maximum size of a family of pairwise non-homotopic simple arcs on joining a fixed pair of distinct punctures of and pairwise intersecting at most twice. On the way, we show that a square annular diagram has a corner on …
The paper studies parabolic representations of 2-bridge links using symplectic quandles.
For any link and for any modulus we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring is formed by each assignment of colors to the arcs of the diagram that is obtaine…
In a recent work "Arc-presentation of links: Monotonic simplification" Ivan Dynnikov showed that each rectangular diagram of the unknot, composite link, or split link can be monotonically simplified into a trivial, composite, or split diagram, respectively. The following natural question arises: Is it always possible t…
The paper establishes a relation between knotoid crossing number and height.
Planar pure braids form a group that acts on a CAT(0) cubical complex.
New estimate of semimeander complexity for knots with more than 10 crossings.
We prove the Kauffman-Harary Conjecture, posed in 1999: given a reduced, alternating diagram D of a knot with prime determinant p, every non-trivial Fox p-coloring of D will assign different colors to different arcs.
New parities defined on virtual knots linked to crossing indices.
Blanchet introduced certain singular cobordisms to fix the functoriality of Khovanov homology. In this paper we introduce graded algebras consisting of such singular cobordisms à la Blanchet. As the main result we give algebraic versions of these algebras using the combinatorics of arc diagrams.
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…
We develop a formalism that allows us to describe Markov compacta with finite sets of diagrams that are building blocks of the entire sequence. This encodes complex, continuous spaces with discrete collections of combinatorial objects. We show that topological properties of the limit (such as -connectedness, local $…
Programs compute Heegaard Floer invariants from open books.
Topological model created for HOMFLY-PT polynomial from link diagrams.
Given a cusped hyperbolic 3-manifold with finite volume, we define two types of complex parameters which capture geometric information about the preimages of geodesic arcs traveling between cusp cross-sections. We prove that these parameters are elements of the invariant trace field of the manifold, providing a connect…
Inspired by the paper on quantum knots and knot mosaics [23] and grid diagrams (or arc presentations), used extensively in the computations of Heegaard-Floer knot homology [2,3,7,24], we construct the more concise representation of knot mosaics and grid diagrams via mirror-curves. Tame knot theory is equivalent to knot…