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

7132026 · Feb 202619922001200920172026
48 results for arc diagrams

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 …

2019-07-24abs ↗pdf ↗

The paper explores when specific knot operations simplify diagrams.

problem Understanding when arc crossing changes simplify knot diagrams.
method Examined two types of arc crossing changes on link diagrams and determined when they are unknotting operations.
result Any two crossing points in an alternating knot diagram are arc crossing change admissible.

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

problem Representing prime knots with 14 crossings and specific arc indices using grid diagrams.
method Enumerated all prime knots with 14 crossings, categorized by arc index, and found minimal grid diagrams for those with arc index 14.
result 8,027 knots with arc index 13 and 15,735 knots with arc index 14 were represented by minimal grid diagrams.

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

problem Finding minimal grid diagrams for prime knots with specific crossing and arc indices.
method Used Knotscape to generate spanning trees and obtain minimal arc presentations in grid diagrams.
result 9,988 prime knots with 13 crossings and 13 arc index were identified.

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 ↗

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…

2010-11-01abs ↗pdf ↗

Minimal grid diagrams found for 13-crossing prime knots.

problem Finding the simplest grid diagrams for prime knots with 13 crossings.
method Converted prime alternating knots to grid diagrams, focusing on minimal configurations.
result 4878 prime alternating knots with 13 crossings have been represented by grid diagrams with 15 vertical segments.

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 \).

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

problem Understanding the topological nature of arcs and crossings in knot theory.
method Topological description of arcs and crossings as isotopy classes of probes, homotopy classes of diagram elements.
result Sets of arcs and crossings are fundamental for algebraic objects like quandles, partial ternary quasigroups, biquandloids, and crossoids.

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…

2013-12-31abs ↗pdf ↗

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…

2016-08-09abs ↗pdf ↗

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

problem Defining link invariants using different presentations of arcs and regions.
method Introducing core groups as link invariants defined by presentations involving arcs or regions, and extending these to virtual link diagrams.
result Properties of core groups and their extensions to virtual link diagrams are discussed.

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…

2019-09-26abs ↗pdf ↗

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…

2011-06-13abs ↗pdf ↗

Rectangular diagrams of links are link diagrams in the plane R2{\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…

2014-05-27abs ↗pdf ↗

The paper proves a generalized Kauffman-Harary conjecture for prime determinant links.

problem Proving a generalized Kauffman-Harary conjecture for prime determinant links.
method Using Fox colorings and properties of reduced alternating diagrams.
result For every pair of distinct arcs in a prime determinant link, there exists a Fox coloring that distinguishes them.

We work on the notions of rail arcs and rail isotopy in R3\mathbb{R}^3, and we introduce the notions of rail knotoid diagrams and their equivalence. Our main result is that two rail arcs in R3\mathbb{R}^3 are rail isotopic if and only if their knotoid diagram projections onto the plane of the two lines which we call ra…

2018-12-22abs ↗pdf ↗

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…

2015-07-10abs ↗pdf ↗

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…

2014-11-02abs ↗pdf ↗

We prove that any 1111-colorable knot is presented by an 1111-colored diagram where exactly five colors of eleven are assigned to the arcs. The number five is the minimum for all non-trivially 1111-colored diagrams of the knot. We also prove a similar result for any 1111-colorable ribbon 22-knot.

2015-05-12abs ↗pdf ↗

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 …

2017-08-06abs ↗pdf ↗

Let SS be an nn-punctured sphere, with n3n \geq 3. We prove that (n3)\binom{n}{3} is the maximum size of a family of pairwise non-homotopic simple arcs on SS joining a fixed pair of distinct punctures of SS and pairwise intersecting at most twice. On the way, we show that a square annular diagram AA has a corner on …

2019-06-14abs ↗pdf ↗

The paper studies parabolic representations of 2-bridge links using symplectic quandles.

problem Parabolic representations of 2-bridge links.
method Convert conjugation quandle equations to symplectic quandle equations, using a polynomial PK(u)P_K(u) to find arc coloring vectors.
result Explicit formulas for parabolic representations of 2-bridge links are derived, including complex volume and cusp shape.

For any link and for any modulus mm 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…

2012-08-05abs ↗pdf ↗

New estimate of semimeander complexity for knots with more than 10 crossings.

problem Estimating the complexity of semimeander diagrams of knots.
method Proved a new upper bound on the number of crossings for semimeander diagrams of knots with more than 10 crossings.
result For knots with more than 10 crossings, semimeander diagrams have no more than 0.311.558cr(K)0.31 \cdot 1.558^{\operatorname{cr}(K)} 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.

2009-06-08abs ↗pdf ↗

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.

2015-10-16abs ↗pdf ↗

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…

2014-11-06abs ↗pdf ↗

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…

2011-06-19abs ↗pdf ↗