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

This purpose of this letter is to handle a gap that was found in the proof of Theorem 2 in the paper "The generalized stochastic likelihood decoder: random coding and expurgated bounds."

We derive sharp lower bounds for the first and the second Zagreb indices ($M_1$ and $M_2$ respectively) for trees and chemical trees with the given number of pendent vertices and find optimal trees. $M_1$ is minimized by a tree with all…

Jain's iterative rounding theorem is a well-known result in the area of approximation algorithms and, more broadly, in combinatorial optimization. The theorem asserts that LP relaxations of several problems in network design and…

This is a short note describing what I believe is a serious gap in Stanfield's proof of Sachs' conjecture that every linklessly embeddable graph has a linear linkless embedding in $\mathbb{R}^3$.

This is essentially an erratum, with some example to indicate inconsistencies. Suppose $A=k[X_1, X_2, \ldots, X_n]$ is a polynomial ring over a field $k$. The Complete Intersection conjecture states that, for any ideal $I$ in $A$,…

We consider the ways in which a 4-tangle T inside a unit cube can be extended outside the cube into a knot or link L. We present two links n(T) and d(T) such that the greatest common divisor of the determinants of these two links always…

I gave a geometric proof of Vojta's 1 + epsilon conjecture. Some gaps in the published paper were spotted and kindly pointed out to me by Paul Vojta. These were addressed in "Erratum".

Recently, we discovered a mistake in our Letter on phase dynamics in granular d-wave superconductors, which we corrected in an Erratum published last week. This is an expanded version of the Erratum, containing details and supporting…

An error in the paper [J. Math. Phys. 43, 6343 (2002); math-ph/0207009] is corrected. Further explanation is given.

There is an error in the proof (but not the truth) of Theorem 3.2 in the author's 1985 paper "The Double-Wedge Algebra for Quantum Fields on Schwarzschild and Minkowski Spacetimes" in "Communications in Mathematical Physics". The author…

This is an erratum to math.AG/9803126, Tohoku 51 (1999) 489-537. This erratum describes: 1. the failure of the algorithm in [AMR] and [Morelli1] for the strong factorization pointed out by Kalle Karu, 2. the statement of a refined weak…

This note refers to our previous paper "The emergence of torsion in the continuum limit of distributed edge-dislocations". It identifies and fixes an error in the notion of convergence of Weitzenb\"ock manifolds defined in the paper, and in…

In this paper we introduce a new invariant of virtual knots and links that is non-trivial for infinitely many virtuals, but is trivial on classical knots and links. The invariant is initially be expressed in terms of a relative of the…

The problem of finding the connected components of a graph is considered. The algorithms addressed to solve the problem are used to solve such problems on graphs as problems of finding points of articulation, bridges, maximin bridge, etc. A…

This paper is a short introduction to and statement of the main theorems of our paper "Virtual Braids and the L-Move", JKTR, Vol. 15, No. 6 (2006), pp. 773-811. See also arxiv:Math.GT/0507035.

In this expository note we present a proof of the V.A. Vassiliev conjecture on the planarity of graphs with vertices of degree 4 and certain additional structure. Both statement and proof are accessible to high-school students familiar with…

We introduce "book links" as a generalization of braids in open book decompositions; this new class of objects includes both braids and plats as special cases. We then prove a version of Markov's theorem in this general setting by extending…

At the request of Laszlo Babai, founder and an editor of the free online journal Theory of Computing (ToC), theoryofcomputing.org, in August, 2025, I am posting on the arXiv, essentially unedited and not updated, a combination of two…

The original versions (1 and 2) of this paper paper contain a fatal error. All my attempts to patch the error have failed. As a service to the community I explain the error in some detail.

This paper addresses the Variable Gapped Longest Common Subsequence (VGLCS) problem, a generalization of the classical LCS problem involving flexible gap constraints between consecutive solutions' characters. The problem arises in molecular…