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,695 papers · 148 categories

Trend · papers per month

70141211281 · Jun 202019922001200920172026
48 results for minimal moves

Minimal sets of moves for isotopic knots and trivalent graphs identified.

problem Identifying minimal sets of moves for isotopic knots and trivalent graphs.
method Provided and proved the existence of minimal generating sets of oriented Reidemeister moves for isotopic knots and spatial trivalent graphs.
result Twelve minimal generating sets of oriented Reidemeister moves for isotopic knots and ten for spatial trivalent graphs identified.

Paper solves the minimal generating set problem for singular Reidemeister moves.

problem Determine minimal generating sets of oriented singular Reidemeister moves.
method Introduced new invariant for singular links to detect type IV moves and provide obstructions.
result Proved exactly 96 distinct inclusion-minimal generating sets for singular moves.

Polyak proved that the set {Ω1a,Ω1b,Ω2a,Ω3a}\{\Omega1a,\Omega1b,\Omega2a,\Omega3a\} is a minimal generating set of oriented Reidemeister moves. One may distinguish between forward and backward moves, obtaining 3232 different types of moves, which we call directed oriented Reidemeister moves. In this article we prove that the set of $…

2016-01-04abs ↗pdf ↗

It is well known that any two diagrams representing the same oriented link are related by a finite sequence of Reidemeister moves O1, O2 and O3. Depending on orientations of fragments involved in the moves, one may distinguish 4 different versions of each of the O1 and O2 moves, and 8 versions of the O3 move. We introd…

2009-08-21abs ↗pdf ↗

Enumerates knots up to five crossings and describes moves between them.

problem Counting and classifying knots up to a specific number of crossings.
method Generated tables of minimal diagrams and derived moves between knots.
result Conjecture about a lower bound for the triple-crossing number based on Alexander polynomial.

In this paper we study the general affine geometry of curves in affine space A2A^2. For a regular plane curves we define two kinds of moving frames. The first is of minimal order in all moving frames.The second is the Frenet moving frame. We get the moving equations of these moving frames. And we prove that curvature a…

2016-03-10abs ↗pdf ↗

Let D(p,q)D(p,q) be the usual knot diagram of the (p,q)(p,q)-torus knot, that is, D(p,q)D(p,q) is the closure of the pp-braid (σ11σ21...σp11)q(σ_1^{-1} σ_2^{-1}... σ_{p-1}^{-1})^q. As is well-known, D(p,q)D(p,q) and D(q,p)D(q,p) represent the same knot. It is shown that D(n+1,n)D(n+1,n) can be deformed to D(n,n+1)D(n,n+1) by a sequence of $\{(n-1)n(2n-1)/6 \} + …

2010-03-06abs ↗pdf ↗

The study proves poor ideal three-edge triangulations are minimal for certain 3-manifolds.

problem Finding minimal ideal triangulations for specific 3-manifolds.
method Analyzing properties of poor ideal three-edge triangulations and applying them to construct minimal triangulations.
result Poor ideal three-edge triangulations are proven to be minimal for certain 3-manifolds.

This study simplifies verification of invariants in oriented virtual knots.

problem Verifying invariants of oriented virtual knots is complex and time-consuming.
method Identifying a minimal generating set of oriented virtual Reidemeister moves.
result A four-element subset serves as a generating set for oriented virtual Reidemeister moves.

We show that the 14 graphs obtained by Y\nabla\mathrm{Y} moves on K_7 constitute a complete list of the minor minimal intrinsically knotted graphs on 21 edges. We also present evidence in support of a conjecture that the 20 graph Heawood family, obtained by a combination of Y\nabla\mathrm{Y} and Y\mathrm{Y}\nabla mo…

2013-03-27abs ↗pdf ↗

Study knot diagrams on a sphere without vertical lines, focusing on minimal crossings.

problem Understanding minimal crossings of knot diagrams on a punctured sphere.
method Mathematical model of string figures using knot diagrams on xyzxyz-space with missing vertical lines, analyzing minimal crossings under Reidemeister moves.
result Minimal number of crossings of knot diagrams on a punctured sphere.

We show that the forbidden detour move, essentially introduced by Kanenobu and Nelson, is an unknotting operation for virtual knots. Then we define the forbidden detour number of a virtual knot to be the minimal number of forbidden detour moves necessary to transform a diagram of the virtual knot into the trivial knot …

2019-08-29abs ↗pdf ↗

We show that the 20 graph Heawood family, obtained by a combination of triangle-Y and Y-triangle moves on K7K_7, is precisely the set of graphs of at most 21 edges that are minor minimal for the property not 22--apex. As a corollary, this gives a new proof that the 14 graphs obtained by triangle-Y moves on K7K_7 are t…

2015-06-22abs ↗pdf ↗

The paper defines and studies discrete p-density and compression-radius profiles of lattice knots.

problem Understanding geometric properties of lattice knots.
method Develops a framework for discrete p-density and compression-radius profiles of lattice knots, studying them on length-filtered sets and finite move-graph exploration.
result Density and compression-radius values are not monotone, illustrating distinct optimization problems.

This paper disproves a conjecture about knot projections under specific homotopy conditions.

problem Reidemeister moves of types 1 and 3 are insufficient to describe all homotopies of circle immersions.
method Constructs counterexamples with minimal crossing numbers of 15 and higher, extending previous results.
result Obtains the first counterexample with a minimal crossing number of 15, extending to higher odd numbers.

This note has an experimental nature and contains no new theorems. We introduce certain moves for classical knot diagrams that for all the very many examples we have tested them on give a monotonic complete simplification. A complete simplification of a knot diagram D is a sequence of moves that transform D into a diag…

2015-08-13abs ↗pdf ↗

Both classical and virtual knots arise as formal Gauss diagrams modulo some abstract moves corresponding to Reidemeister moves. If we forget about both over/under crossings structure and writhe numbers of knots modulo the same Reidemeister moves, we get a dramatic simplification of virtual knots, which kills all classi…

2009-02-01abs ↗pdf ↗

New method estimates velocity fields for minimizing ff-divergences without overfitting.

problem Minimizing statistical discrepancies between target and particle distributions.
method Directly estimate velocity fields using interpolation techniques, proving consistency under mild conditions.
result Consistent estimators of velocity fields improve accuracy in applications like domain adaptation and missing data imputation.

We construct a new order 1 invariant for knot diagrams. We use it to determine the minimal number of Reidemeister moves needed to pass between certain pairs of knot diagrams.

2007-08-18abs ↗pdf ↗

Discrete knot theory models use lattice-filtered graphs to detect merging knot components.

problem Detecting merging knot components in discrete models.
method Lattice-filtered move graphs to model knot types, identifying connected components and merge scales.
result Merge scale defined by connected components of lattice-filtered move graphs, with specific examples for the figure-eight knot.

We provide a characterization of the Clifford Torus in S3 via moving frames and contact structure equations. More precisely, we prove that minimal surfaces in S3 with constant contact angle must be the Clifford Torus. Some applications of this result are then given, and some examples are discussed.

2007-05-22abs ↗pdf ↗

This is the first of three papers that refine and extend portions of our earlier preprint, "Depth of a knot tunnel." Together, they rework the entire preprint. H. Goda, M. Scharlemann, and A. Thompson described a general construction of all tunnels of all tunnel number 1 knots using "tunnel moves". We apply the theory …

2008-12-07abs ↗pdf ↗

In this paper, we prove a generalization of Rado's Theorem, a fundamental result of minimal surface theory, which says that minimal surfaces over a convex domain with graphical boundaries must be disks which are themselves graphical. We will show that, for a minimal surface of any genus, whose boundary is "almost graph…

2005-02-25abs ↗pdf ↗

Paper shows non-CSC HCMU metrics can't be isometrically immersed into 3D space forms.

problem Non-CSC HCMU metrics cannot be isometrically immersed into 3D space forms.
method Using moving frames to demonstrate the impossibility of isometric minimal immersion.
result Non-CSC HCMU metrics cannot be isometrically immersed into 3D space forms.

The paper defines new homotopy relations on knot projections and classifies certain knot types.

problem Defining and classifying knot homotopy relations.
method Introducing cross chord numbers and using them to define strong and weak (1, 3) homotopies.
result Complete classification of knot projections with trivializing number two.

Manturov recently introduced the idea of a free knot, i.e. an equivalence class of virtual knots where equivalence is generated by crossing change and virtualization moves. He showed that if a free knot diagram is associated to a graph that is irreducibly odd, then it is minimal with respect to the number of classical …

2010-08-18abs ↗pdf ↗