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.
A knot is fertile if it can generate all smaller knots through a specific diagram modification.
We study trisections of 4-manifolds obtained by spinning and twist-spinning 3-manifolds, and we show that, given a (suitable) Heegaard diagram for the 3-manifold, one can perform simple local modifications to obtain a trisection diagram for the 4-manifold. We also show that this local modification can be used to conver…
Persistence diagrams are two-dimensional plots that summarize the topological features of functions and are an important part of topological data analysis. A problem that has received much attention is how deal with sets of persistence diagrams. How do we summarize them, average them or cluster them? One approach -- th…
Roseman moves are seven types of local modification for surface-link diagrams in -space which generate ambient isotopies of surface-links in -space. In this paper, we focus on Roseman moves involving triple points, one of which is the famous tetrahedral move, and discuss their independence. For each diagram of an…
Study shows that splitting links requires an arbitrarily large number of extra crossings.
Many invariants of knots rely upon smoothing the knot at its crossings. To compute them, it is necessary to know how to count the number of connected components the knot diagram is broken into after the smoothing. In this paper, it is shown how to use a modification of a theorem of Zulli together with a modification of…
New proof shows knot Floer thickness limits bad domains in diagrams.
Improved modeling of persistence diagrams for data analysis.
We discuss a topological approach to words introduced by the author. Words on an arbitrary alphabet are approximated by Gauss words and then studied up to natural modifications inspired by the Reidemeister moves on knot diagrams. This leads us to a notion of homotopy for words. We introduce several homotopy invariants …
The purpose of this paper is twofold. On one hand, we introduce a modification of the dual canonical basis for invariant tensors of the 3-dimensional irreducible representation of , given in terms of Jacobi diagrams, a central tool in quantum topology. On the other hand, we use this modified basis to study t…
This paper considers the invariance of knot Floer homology in a purely algebraic setting, without reference to Heegaard diagrams, holomorphic disks, or grid diagrams. We show that (a small modification of) Ozsváth and Szabó's cube of resolutions for knot Floer homology, which is assigned to a braid presentation with a …
The Sarkar-Wang algorithm computes the hat version of the Heegaard Floer homology of a closed oriented three manifold. This paper analyzes the computational complexity of the Sarkar-Wang algorithm; then the algorithm is modified to obtain a better bound. Then the computational complexity of calculating HFK hat from a H…
A new method calculates HOMFLY-PT polynomials for bipartite links.
An R_2-move is a homotopy of wrinkled fibrations which deforms images of indefinite fold singularities like Reidemeister move of type II. Variants of this move are contained in several important deformations of wrinkled fibrations, flip and slip for example. In this paper, we first investigate how monodromies are chang…
Survey of various non-classical knot theories from geometric and algebraic perspectives.
In the present paper, we construct an invariant for virtual knots in the thickened sphere with g handles; this invariant is a Laurent polynomial in 2g+3 variables. To this end, we use a modification of the Wirtinger presentation of the knot group and the concept of parity introduced by V.O.Manturov. The section 4 of th…
This work improves testing of machine learning model modifications using novel statistical methods.
The paper refines transformations of lattice diagrams and introduces dotted diagrams.
The aim of this work is to explore the possible types of phenomena that simple macroeconomic Agent-Based models (ABM) can reproduce. We propose a methodology, inspired by statistical physics, that characterizes a model through its 'phase diagram' in the space of parameters. Our first motivation is to understand the lar…
This note explains how to transform Heegaard diagrams into framed link diagrams.
New minimal link diagrams found, including torus links and homogeneous ones.
New method detects RNA modifications without prior training, revealing novel sites.
Algorithm converts Kirby diagrams to trisection diagrams for 4-manifolds.
We define an operation on homology which we call an -twist annulus modification. We give a new construction of smoothly slice knots and exotically slice knots via -twist annulus modifications. As an application, we present a new example of a smoothly slice knot with non-slice derivatives. Such examples we…
Kernelized Taylor diagram visualizes data populations with fewer assumptions.
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram by use of the double covering …
Study categorizes knots and links as rigid or shaky based on Reidemeister moves.
Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower bound for the virtual crossing number of virtual graph diagrams.
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link d…
Persistence diagrams are important descriptors in Topological Data Analysis. Due to the nonlinearity of the space of persistence diagrams equipped with their {\em diagram distances}, most of the recent attempts at using persistence diagrams in machine learning have been done through kernel methods, i.e., embeddings of …
Problems on region choices for knot and link diagrams solved using Alexander numbering.
Table of symmetric diagrams for knots up to 10 crossings.
The presence of slipknots in configurations of proteins and DNA has been shown to affect their functionality, or alter it entirely. Historically, polymers are modeled as polygonal chains in space. As an alternative to space curves, we provide a framework for working with subknots inside of knot diagrams via knotoid dia…
Proves minimal crossing diagrams for specific spatial graphs.
Rectangular diagrams help analyze foliations in 3-sphere.
Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram representing the trivial knot. As a corollary we determine an unknotting number one alter…
The paper explores when specific knot operations simplify diagrams.
Gauss diagrams' properties can change with Hamiltonian cycle choice.
New estimate of semimeander complexity for knots with more than 10 crossings.
Paper proves link diagrams can be realized for some but not all types of links.
GridPyM handles grid diagrams for knot theory.
There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While every plane graph arises as a Tait graph of a unique link diagram, not every embedd…
The study improves inequalities for link diagrams and introduces weak rectangular diagrams.
In this paper, a link diagram is said to be minimal if no Reidemeister move I or II can be applied to it to reduce the number of crossings. We show that for an arbitrary diagram D of a link without a trivial split component, a minimal diagram obtained by applying Reidemeister moves I and II to D is unique. The proof al…
Algorithm for recognizing and performing Reidemeister moves in Gauss diagrams.
Standard trisection diagrams found for Mazur type 4-manifolds.
By using the cohomology theory of quandles, quandle cocycle invariants and shadow quandle cocycle invariants are defined for oriented links and surface-links via broken surface diagrams. By using symmetric quandles, symmetric quandle cocycle invariants are also defined for unoriented links and surface-links via broken …
Minimal grid diagrams for 12-crossing prime knots identified.