Related papers: A prime decomposition theorem for the 2-string lin…

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…

Utilizing both twisting and writhing, we construct integral tangles with few sticks, leading to an efficient method for constructing polygonal 2-bridge links. Let L be a two bridge link with crossing number c, stick number s, and n tangles.…

Cyclic pre-proofs can be represented as sets of finite tree derivations with back-links. In the frame of the first-order logic with inductive definitions, the nodes of the tree derivations are labelled by sequents and the back-links connect…

Stein proved that for each simple plane triangulation H there exists a partitioning of the vertex of H into two subsets each of which induces a forest if and only if the dual H^{*} has a Hamilton cycle. We extend the Stein theorem for…

We present a unified treatment of the slicing (3+1) and threading (1+3) decompositions of spacetime in terms of foliations. It is well-known how to decompose the metric and connection in the slicing picture; this is at the heart of any…

This paper is a continuations of the project initiated in the book string topology for stacks. We construct string operations on the SO(2)-equivariant homology of the (free) loop space $L(X)$ of an oriented differentiable stack $X$ and show…

We give conditions for a n-connective quasicoherent obstruction theory on a Deligne-Mumford stack to come from the structure of a connective spectral Deligne-Mumford stack on the underlying topos.

For a positive braid link, a link represented as a closed positive braids, we determine the first few coefficients of its HOMFLY polynomial in terms of geometric invariants such as, the maximum euler characteristics, the number of split…

This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix…

A commuting tuple of $n$ operators $(S_1, \dots, S_{n-1}, P)$ defined on a Hilbert space $\mathcal{H}$, for which the closed symmetrized polydisc \[ \Gamma_n = \left\{ \left(\sum_{i=1}^{n}z_i, \sum\limits_{1\leq i<j\leq n}z_iz_j, \dots,…

We prove that any knot or link in any 3-manifold can be nicely decomposed (splitted) by a filling Dehn sphere. This has interesting consequences in the study of branched coverings over knots and links. We give an algorithm for computing…

This is a continuation of the early paper concerning matroid base polytope decomposition. Here, we will present sufficient conditions on $M$ so its base matroid polytope $P(M)$ has a {\em sequence} of hyperplane splits. The latter yields to…

We introduces the umodules, a generalisation of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and $2-$structures. We show that, under some axioms, a unique decomposition…

In this paper, we take a unified approach for network information theory and prove a coding theorem, which can recover most of the achievability results in network information theory that are based on random coding. The final single-letter…

We present several conditions for generic uniqueness of tensor decompositions of multilinear rank (1,L_{1}, L_{1}),..., (1, L_{R}, L_{R}) terms. In geometric language, we prove that the joins of relevant subspace varieties are not…

A construction is presented that allows to produce subspace codes of long length using subspace codes of shorter length in combination with a rank metric code. The subspace distance of the resulting code, called linkage code, is as good as…

This paper introduces the notion of involution module, the first generalization of the modular decomposition of 2-structure which has a unique linear-sized decomposition tree. We derive an O(n^2) decomposition algorithm and we take…

Monolayer transition metal dichalcogenides (TMDs) have the potential to unlock novel photonic and chemical technologies if their optoelectronic properties can be understood and controlled. Yet, recent work has offered contradictory…

Recent developments in machine-learning based molecular fragment linking have demonstrated the importance of informing the generation process with structural information specifying the relative orientation of the fragments to be linked.…

Manipulation of three-dimensional (3D) topological objects is of both fundamental interest and practical importance in many branches of physics. Here, we show by spin dynamics simulations that the bifurcation of a 3D skyrmion string in a…