arXiv research

A new knot move preserves pass-move equivalence and differs in count.

Complete classification of links up to specific moves.

The (ordinary) unknotting-number of 1-dimensional knots, which is defined by using the crossing-change, is a very basic and important invariant. It is very natural to consider the `unknotting-number' associated with other local-moves on n-dimensional knots, where n is a natural number. In this paper we prove the follow…

Study virtualized Delta, Sharp, and Pass moves for oriented virtual knots and links.

A pass-move and a $#$-move are local moves on oriented links defined by L.H. Kauffman and H. Murakami respectively. Two links are self pass-equivalent (resp. self $#$-equivalent) if one can be deformed into the other by pass-moves (resp. $#$-moves), where non of them can occur between distinct components of the link. T…

In the present paper, we consider local moves on classical and welded diagrams: (self-)crossing change, (self-)virtualization, virtual conjugation, Delta, fused, band-pass and welded band-pass moves. Interrelationship between these moves is discussed and, for each of these move, we provide an algebraic classification. …

We provide an upper bound on the number of ordered Reidemeister moves required to pass between two diagrams of the same link. This bound is in terms of the number of unordered Reidemeister moves required.

We use the terms, knot product and local move, as defined in the text of the paper. Let $n$ be an integer$\geqq3$. Let $\mathcal S_n$ be the set of simple spherical $n$-knots in $S^{n+2}$. Let $m$ be an integer$\geqq4$. We prove that the map $j:\mathcal S_{2m}\to\mathcal S_{2m+4}$ is bijective, where $j(K)=K\otimes$Hop…

In this paper, we prove that given two cubical links of dimension two in ${\mathbb R}^4$, they are isotopic if and only if one can pass from one to the other by a finite sequence of cubulated moves. These moves are analogous to the Reidemeister and Roseman moves for classical tame knots of dimension one and two, respec…

We provide an explicit upper bound on the number of Reidemeister moves required to pass between two diagrams of the same link. This leads to a conceptually simple solution to the equivalence problem for links.

We present a sequence of diagrams of the unknot for which the minimum number of Reidemeister moves required to pass to the trivial diagram is quadratic with respect to the number of crossings. These bounds apply both in $S^2$ and in $\R^2$.

We study generalizations of finite-type knot invariants obtained by replacing the crossing change in the Vassiliev skein relation by some other local move, analyzing in detail the band-pass and doubled-delta moves. Using braid-theoretic techniques, we show that, for a large class of local moves, generalized Goussarov's…

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.

It is shown that two braids represent transversally isotopic links if and only if one can pass from one braid to another by conjugations in braid groups, positive Markov moves, and their inverses.

Message passing is the key to graph neural networks, but new terms are needed to avoid confusion.

The flat plumbing basket presentation of a link is introduced by Furihata, Hirasawa and Kobayashi. In this paper, we show that the pass-equivalence and an equivalence introduced by using the flat plumbing basket presentation are the same relation. Furthermore, we obtain an evaluation of the minimal number of bands used…

In this paper, we prove than given two cubic knots $K_1$, $K_2$ in $\mathbb{R}^3$, they are isotopic if and only if one can pass from one to the other by a finite sequence of cubulated moves. These moves are analogous to the Reidemeister moves for classical tame knots. We use the fact that a cubic knot is determined by…

We introduce a method of computing biquandle brackets of oriented knots and links using a type of decorated trivalent spatial graphs we call trace diagrams. We identify algebraic conditions on the biquandle bracket coefficients for moving strands over and under traces and identify a new stop condition for the recursive…

We show that the maximal number of singular moves required to pass between any two regularly homotopic planar or spherical curves with at most n crossings, grows quadratically with respect to n. Furthermore, this can be done with all curves along the way having at most n+2 crossings.

A necessary and sufficient algebraic condition for a diffeomorphism over a surface embedded in the 3-sphere to be induced by a regular homotopic deformation is discussed, and a formula for the number of signed pass moves needed for this regular homotopy is given.

Paper predicts cryptocurrency bull and bear phases using Bitcoin's moving averages.

We prove the following: Let $2p + 1$ be no less than 5 and $p$ be a natural number. Let $K$ and $J$ be closed, oriented, $(2p+1)$-dimensional connected, $(p-1)$-connected, simple submanifolds of the standard $(2p+3)$-sphere. Then $K$ is equivalent to $J$ if and only if a Seifert matrix associated with a simple Seifert …

This article surveys many aspects of the theory of quandles which algebraically encode the Reidemeister moves. In addition to knot theory, quandles have found applications in other areas which are only mentioned in passing here. The main purpose is to give a short introduction to the subject and a guide to the applicat…

Monotonicity formulae play a crucial role for many geometric PDEs, especially for their regularity theories. For minimal submanifolds in a Euclidean ball, the classical monotonicity formula implies that if such a submanifold passes through the centre of the ball, then its area is at least that of the equatorial disk. R…

New algorithm minimizes FE objectives for synthetic AIF agents.

A {\em good drawing\/} of $K_n$ is a drawing of the complete graph with $n$ vertices in the sphere such that: no two edges with a common end cross; no two edges cross more than once; and no three edges all cross at the same point. Gioan's Theorem asserts that any two good drawings of $K_n$ that have the same rotations …

The paper analyzes MACD using operator theory.

New framework for estimating treatment effects in experiments with network interference.

Motivated by the programmes initiated by Taubes and Perutz, we study the geometry of near-symplectic 4-manifolds, i.e., manifolds equipped with a closed 2-form which is symplectic outside a union of embedded 1-dimensional submanifolds, and broken Lefschetz fibrations on them. We present a set of four moves which allow …

This paper defines a theory of cobordism for virtual knots and studies this theory for standard and rotational virtual knots and links. Non-trivial examples of virtual slice knots are given. Determinations of the four-ball genus of positive virtual knots are given using the results of a companion paper by the author an…

Classical knots in $\mathbb{R}^3$ can be represented by diagrams in the plane. These diagrams are formed by curves with a finite number of transverse crossings, where each crossing is decorated to indicate which strand of the knot passes over at that point. A pseudodiagram is a knot diagram that may be missing crossing…

A G-coloured knot is a knot together with a representation of its knot group onto G. Two G-coloured knots are said to be rho-equivalent if they are related by surgery around unit framed unknots in the kernels of their colourings. The induced local move is a G-coloured analogue of the crossing change. For certain famili…

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

Study of pseudo knots, links, and knotoids with braiding and L-moves.

We present the Causal Gaussian Process Convolution Model (CGPCM), a doubly nonparametric model for causal, spectrally complex dynamical phenomena. The CGPCM is a generative model in which white noise is passed through a causal, nonparametric-window moving-average filter, a construction that we show to be equivalent to …

A neural network method for financial data nowcasting.

Developing feature selection algorithms that move beyond a pure correlational to a more causal analysis of observational data is an important problem in the sciences. Several algorithms attempt to do so by discovering the Markov blanket of a target, but they all contain a forward selection step which variables must pas…

Proposes a scalable framework for extracting data manifold geometry.

A new model prices assets considering market microstructure effects.

We develop an algebraic version of Cartan method of equivalence or an analog of Tanaka prolongation for the (extrinsic) geometry of curves of flags of a vector space $W$ with respect to the action of a subgroup $G$ of the $GL(W)$. Under some natural assumptions on the subgroup $G$ and on the flags, one can pass from th…

New method for computing Kauffman bracket skein module of lens spaces using unoriented braids.

We proved by computer enumeration that the Jones polynomial distinguishes the unknot for knots up to 22 crossings. Following an approach of Yamada, we generated knot diagrams by inserting algebraic tangles into Conway polyhedra, computed their Jones polynomials by a divide-and-conquer method, and tested those with triv…

We analyze oversquashing in topological message-passing using relational structures.

Optimizes reinforcement learning by prioritizing sets of samples over individual ones.

The study predicts pass completion probability in NFL games.

ZeroSCROLLS benchmarks zero-shot natural language understanding over long texts.

This article is motivated by soccer positional passing networks collected across multiple games. We refer to these data as replicated spatial passing networks---to accurately model such data it is necessary to take into account the spatial positions of the passer and receiver for each passing event. This spatial regist…

ADMP-GNN dynamically adjusts message-passing layers for better graph learning performance.