Related papers: Erratum: Studying Links via Closed Braids IV: Comp…

We point out an essential gap in the proof of one of main results in \cite{M} and then give a corrected proof for it.

We define the notion of a braided link cobordism in $S^3 \times [0,1]$, which generalizes Viro's closed surface braids in $\mathbb{R}^4$. We prove that any properly embedded oriented surface $W \subset S^3 \times [0,1]$ is isotopic to a…

A digraph is {\bf \( k \)-linked} if for arbitary two disjoint vertex sets \(\{s_1, \ldots, s_k\}\) and \(\{t_1, \ldots, t_k\}\), there exist vertex-disjoint directed paths \(P_1, \ldots, P_k\) {such that \(P_i\) is a directed path from…

In view of the result of Kontsevich, now often called ``the fundamental theorem of Vassiliev theory'', identifying the graded dual of the associated graded vector space to the space of Vassiliev invariants filtered by degree with the linear…

We point out some major technical and conceptual mistakes which invalidate the conclusion drawn in "Anyonic braiding in optical lattices" by C. Zhang, V. W. Scarola, S. Tewari, and S. Das Sarma published in PNAS 104, 18415 (2007).

This note corrects a discrepancy between the semantics and the algorithm of the multiple until operator of CSL, like in Pr_{> 0.0025} (a until[1,2] b until[3,4] c), of the article: Model-checking continuous-time Markov chains by Aziz,…

In this note we fill a gap in the proof of the main theorem (Theorem 1.2) of our paper 'Surfaces in 4-manifolds', Math. Res. Letters 4 (1997), 907-914.

We correct the K-theory computation for ring C*-algebras associated with rings of integers in number fields.

This very short correction notes a gap in an argument of an earlier paper, and also provides a theorem of similar flavor to the main result of that paper.

In this corrigendum to arXiv:2305.02973, we justify that the motivation behind Conjecture 5.1 is based on a mistaken notion. Moreover, we prove a stronger theorem that disproves the conjecture, and obtain an optimal gradient vector field on…

A structured approach for the Collatz conjecture is presented using just the odd integers that are, in turn, divided into categories based on the roles they play such as Starter, Intermediary and Terminal. The expression 4x+1 is used as a…

This note corrects conditions in Proposition 3.4 and Theorem 5.2(ii) and comments on imprecisions in Propositions 4.2 and 4.4 in Fissler and Ziegel (2016).

In previous papers, the author realized the following principle for many knot theories: if a knot diagram is complicated enough then it reproduces itself, i.e., is a subdiagram of any other diagram equivalent to it. This principle is…

Let $G$ be a bridgeless cubic graph. In 2023, the three authors solved a conjecture (also known as the $S_4$-Conjecture) made by Mazzuoccolo in 2013: there exist two perfect matchings of $G$ such that the complement of their union is a…

It is well known that any link can be represented by the closure of a braid. The minimum number of strings needed in a braid whose closure represents a given link is called the braid index of the link and the well known…

This paper presents a phenomenon which sometimes occurs in tetravalent bipartite locally dart-transitive graphs, called a Base Graph -- Connection Graph dissection. In this dissection, each white vertex is split into two vertices of valence…

Traditional symbolic reasoning engines, while attractive for their precision and explicability, have a few major drawbacks: the use of brittle inference procedures that rely on exact matching (unification) of logical terms, an inability to…

We study the booklink, a braid-like embedding with local maxima and minima, and the bridge-braid spectrum of a link, which captures the smallest number of braid-strands in a booklink with a prescribed number of critical points. This…

We establish several useful commutative diagrams consisting of low term exact sequences attached to {\Grot} spectral sequences, which extends and integrates the previous ones appeared in literature such as Alexei~N. Skorobogatov [Beyond the…

In classical knot theory, Markov's theorem gives a way of describing all braids with isotopic closures as links in $\mathbb{R}^3$. We present a version of Markov's theorem for extended loop braids with closure in $B^3 \times S^1$, as a…