Related papers: Over then Under Tangles
We consider several classes of knotted objects, namely usual, virtual and welded pure braids and string links, and two equivalence relations on those objects, induced by either self-crossing changes or self-virtualizations. We provide a…
Out-of-distribution detection (OOD) is a pivotal task for real-world applications that trains models to identify samples that are distributionally different from the in-distribution (ID) data during testing. Recent advances in AI,…
Holomorphic manifolds over Cayley-Dickson algebras are defined and their embeddings and immersions are studied.
There is a natural bijection between Dyck paths and basis diagrams of the Temperley-Lieb algebra defined via tiling. Overhang paths are certain generalisations of Dyck paths allowing more general steps but restricted to a rectangle in the…
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of $+1$ or $-1$. We define the adjacency, incidence and Laplacian matrices of an oriented hypergraph and study each of them. We extend several matrix…
We introduce the notion of a braided Lie algebra consisting of a finite-dimensional vector space $\CL$ equipped with a bracket $[\ ,\ ]:\CL\tens\CL\to \CL$ and a Yang-Baxter operator $\Psi:\CL\tens\CL\to \CL\tens\CL$ obeying some axioms. We…
We survey an abstract theory of connectivity, based on symmetric submodular set functions. We start by developing Robertson and Seymour's fundamental duality between branch decompositions (related to the better-known tree decompositions)…
Bach et al. [1] recently presented an algorithm for constructing confluent drawings, by leveraging power graph decomposition to generate an auxiliary routing graph. We identify two issues with their method which we call the node split and…
Latent Euclidean embedding models a given network by representing each node in a Euclidean space, where the probability of two nodes sharing an edge is a function of the distances between the nodes. This implies that for two nodes to share…
The discrete tensorial charges carried by orientifold planes define n-gerbes in space-time. The simplest way to ensure a consistent string compactification is to require these gerbes to be flat. This results in expressions for the local…
Recent theoretical work has established connections between over-parametrized neural networks and linearized models governed by he Neural Tangent Kernels (NTKs). NTK theory leads to concrete convergence and generalization results, yet the…
Every end of an infinite graph $ G $ defines a tangle of infinite order in $ G $. These tangles indicate a highly cohesive substructure in the graph if and only if they are closed in some natural topology. We characterize, for every finite…
A special class of braids, called woven, is introduced and it is shown that every conjugation class of the braid group contains woven braids. In consequence, links can be presented as plats or closures of woven braids. Restricting on knots,…
We present a computationally efficient algorithm that can be used to generate all possible brane tilings. Brane tilings represent the largest class of superconformal theories with known AdS duals in 3+1 and also 2+1 dimensions and have…
A tangle of order $k$ in a matroid or graph may be thought of as a "$k$-connected component". For a tangle of order $k$ in a matroid or graph that satisfies a certain robustness condition, we describe a tree decomposition of the matroid or…
Orthogonal graph drawing has many applications, e.g., for laying out UML diagrams or cableplans. In this paper, we present a new pipeline that draws multigraphs orthogonally, using few bends, few crossings, and small area. Our pipeline…
Over recent years there has been much interest in both Tur\'an and Ramsey properties of vertex ordered graphs. In this paper we initiate the study of embedding spanning structures into vertex ordered graphs. In particular, we introduce a…
Overlapping clusters are common in models of many practical data-segmentation applications. Suppose we are given $n$ elements to be clustered into $k$ possibly overlapping clusters, and an oracle that can interactively answer queries of the…
The linear transports along paths in vector bundles introduced in Ref. [1] are applied to the special case of tensor bundles over a given differentiable manifold. Links with the transports along paths generated by derivations of tensor…
We study graph realization problems from a distributed perspective and we study it in the node capacitated clique (NCC) model of distributed computing, recently introduced for representing peer-to-peer networks. We focus on two central…