Related papers: Erratum: Studying Links via Closed Braids IV: Comp…
We reprove and extend a result of David Krebes (J. Knot Theory Ramif. 8 (1999), 321-352) giving an obstruction to embedding a tangle T into a link L. Closing the tangle up in the two obvious ways gives rise to two links, the numerator and…
For $k \ge 4$, let $Q_{2k}$ and $V_{2k}$ denote the ladder and M\"obius ladder on $2k$ vertices, respectively. We prove results that build on a result by Wormald that states that any cyclically $4$-connected cubic graph other than $Q_8$ or…
We discuss the consequences of the incorrectness [see the Erratum in Phys. Rev D 49, 1145 (1994)] of that paper and add two related remarks. The scope of this comment is to encourage further research on: `Which of the conformally equivalent…
The cycle double cover conjecture is a long standing problem in graph theory, which links local properties, the valency of a vertex and no bridges, and a global property of the graph, being covered by a particular set of cycles. We prove…
Erratum for paper "Light-induced desorption of alkali-metal atoms from paraffin coating" [Phys. Rev. A 66, 042903 (2002).
In his seminal paper that inaugurated abstract argumentation, Dung proved that the set of complete extensions forms a complete semilattice with respect to set inclusion. In this note we demonstrate that this proof is incorrect with…
The interest in channel models in which the data is sent as an unordered set of binary strings has increased lately, due to emerging applications in DNA storage, among others. In this paper we analyze the minimal redundancy of binary codes…
A contraction sequence of a graph consists of iteratively merging two of its vertices until only one vertex remains. The recently introduced twin-width graph invariant is based on contraction sequences. More precisely, if one puts red edges…
We use the theory of oriented matroids to show that any linear embedding of $K_9$, the complete graph on nine vertices, contains a non-split link with three components.
This short note aims to point out mistakes in one of the implications for Theorem 2.8 in Bayraktar and Yu [Mathematical Finance, 28 (2018), pp. 800-838], which weakens the statement of this theorem.
The paper is suspended. The reason: as was noted by prof. H. Esnault, Theorem 2.1.1 of the previous version (as well as the related Theorem 6.1.1 of http://arxiv.org/PS_cache/math/pdf/9908/9908037v2.pdf of D. Arapura and P. Sastry) is wrong…
This largely technical paper is divided into two parts: part I: An account of P. Ozsvath and Z. Szabo's construction of the link surgery spectral sequence. There are no new results here, but this part slightly modifies and expands their…
This is a revised version of our original paper (arXiv:1808.00489v2) incorporating the corrections published in a corrigendum (arXiv:1808.00489v3). Our main theorem as originally stated was missing the required assumption that matroids…
In the present paper, we proceed the study of framed $4$-graph minor theory initiated in ``Framed $4$-valent Graph Minor Theory I. Intoduction. Planarity Criterion '' and justify the planarity theorem for arbitrary framed 4-graphs; besides,…
In this paper we study the theory of {\it pseudo knots}, which are knots with some missing crossing information, and we introduce and study the theory of {\it pseudo tied links} and the theory of {\it pseudo knotoids}. In particular, we…
WITHDRAWN: The proof contains an uncorrectable gap in the proof of theorem 7 on page 11. A proof of the Krzyz conjecture is presented, based on the application of the variational method, as well as on the use of two classical results and…
For three decades online recurrent learning has been assumed to require propagating a Jacobian tensor through the network's dynamics at $O(n^4)$ per step. We show it doesn't. Dropping the propagation entirely ($d=0$, $O(n^2)$ memory)…
We introduce two common divisor graphs associated with a finite skew brace, based on its $\lambda$- and $\theta$-orbits. We prove that the number of connected components is at most two and the diameter of a connected component is at most…
In this paper, we point out several errors in [M.Afkhami, K.Khashyarmanesh and K.Nafar, Zero divisor graph of a lattice with respect to an ideal, Beitr Algebra Geom (2015), 217-225.]. In the previous article, Afkhami claimed that the…
Linear logic was conceived in 1987 by Girard and, in contrast to classical logic, restricts the usage of the structural inference rules of weakening and contraction. With this, atoms of the logic are no longer interpreted as truth, but as…