Related papers: A prime decomposition theorem for the 2-string lin…
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 consider M-theory in the presence of M parallel M5-branes probing a transverse A_{N-1} singularity. This leads to a superconformal theory with (1,0) supersymmetry in six dimensions. We compute the supersymmetric partition function of…
As an extension of a classical tree-partition problem, we consider decompositions of graphs into edge-disjoint (rooted-)trees with an additional matroid constraint. Specifically, suppose we are given a graph $G=(V,E)$, a multiset…
We present a construction of subspace codes along with an efficient algorithm for list decoding from both insertions and deletions, handling an information-theoretically maximum fraction of these with polynomially small rate. Our…
The decomposition theory of matroids initiated by Paul Seymour in the 1980's has had an enormous impact on research in matroid theory. This theory, when applied to matrices over the binary field, yields a powerful decomposition theory for…
We propose a novel and efficient method for link prediction in bipartite networks, using \textit{formal concept analysis} (FCA) and the Transformer encoder. Link prediction in bipartite networks finds practical applications in various…
Seymour's decomposition theorem is a hallmark result in matroid theory presenting a structural characterization of the class of regular matroids. Formalization of matroid theory faces many challenges, most importantly that only a limited…
Let $M$ be a connected, closed, oriented three-manifold and $K$, $L$ two rationally null-homologous oriented simple closed curves in $M$. We give an explicit algorithm for computing the linking number between $K$ and $L$ in terms of a…
This work considers communication networks where individual links can be described as MIMO channels. Unlike orthogonal modulation methods (such as the singular-value decomposition), we allow interference between sub-channels, which can be…
In the present work, we realize the space of 2-string links $\mathcal{L}$ as a free algebra over a colored operad denoted $\mathcal{SCL}$ (for "Swiss-Cheese for links"). This result extends works of Burke and Koytcheff about the quotient of…
Traditional smearing or blocking techniques serve well to increase the overlap of operators onto physical states but allow for links orientated only along lattice axes. Recent attempts to construct more general propagators have shown…
We develop semistrict higher gauge theory from first principles. In particular, we describe the differential Deligne cohomology underlying semistrict principal 2-bundles with connective structures. Principal 2-bundles are obtained in terms…
The recent developments in string theory suggest that the space-time coordinates should be generalized to non-commuting matrices. Postulating this suggestion as the fundamental geometrical principle, we formulate a candidate for covariant…
String diagrams are pictorial representations for morphisms of symmetric monoidal categories. They constitute an intuitive and expressive graphical syntax, which has found application in a very diverse range of fields including concurrency…
For any pair of integers $m$ and $n$ such that $3<m<n$, we provide an infinite family of links, where each link in the family has a locally minimal $n$-bridge position and a globally minimal $m$-bridge position. We accomplish this by…
Motivated by mass-spectrometry protein sequencing, we consider a simply-stated problem of reconstructing a string from the multiset of its substring compositions. We show that all strings of length 7, one less than a prime, or one less than…
We prove that deciding whether the edge set of a graph can be partitionned into two spanning trees with orientation constraints is NP-complete. If P $\neq$ NP then this disproves a conjecture of Recski.
Beginning with a review of the arguments leading to the so-called c=1 barrier in the continuum formulation of noncritical string theory, the pathology is then exhibited in a discretized version of the theory, formulated through dynamical…
We develop a theory of link projections to trivalent spines of 3-manifolds. We prove a Reidemeister Theorem providing a set of combinatorial moves sufficient to relate the projections of isotopic links. We also show that any link admits a…
Power law systems have been studied extensively due to their wide-ranging applications, particularly in chemistry. In this work, we focus on power law systems that can be decomposed into stoichiometrically independent subsystems. We show…