Related papers: Minimal braid representatives of quasipositive lin…
We show that two knots have matching Vassiliev invariants of order less than n if and only if they are equivalent modulo the nth group of the lower central series of some pure braid group, thus characterizing Vassiliev's knot invariants in…
We prove that the Jones diameter of a link is twice its crossing number whenever the breadth of its Jones polynomial equals the difference between the crossing number and the Turaev genus. This implies that such link is adequate, as per the…
In this paper we investigate the geometric properties of quasi-trees, and prove some equivalent criteria. We give a general construction of a tree that approximates the ends of a geodesic space, and use this to prove that every quasi-tree…
The present paper studies the structure of characteristic varieties of fundamental groups of graph manifolds. As a consequence, a simple proof of Papadima's question is provided on the characterization of algebraic links that have…
We classify the irreducible projective representations of symmetric and alternating groups of minimal possible and second minimal possible dimensions, and get a lower bound for the third minimal dimension. On the way we obtain some new…
We construct a minimum tree for some boundary symmetric tetrahedra R^3, which has two nodes (interior points) with equal weights (positive numbers) having the property that the common perpendicular of some two opposite edges passes through…
In this paper, we propose a network whose nodes are labeled by the composite numbers and two nodes are connected by an undirected link if they are relatively prime to each other. As the size of the network increases, the network will be…
We investigate the structure of reduced triply graded link homology $\overline{\mathrm{HHH}}$ in the top/bottom three $T-$degrees for links arising as closures of positive/negative braids. Using a diagrammatic approach to the Hochschild…
Link prediction is one of the fundamental problems in network analysis. In many applications, notably in genetics, a partially observed network may not contain any negative examples of absent edges, which creates a difficulty for many…
In this paper we use artificial neural networks to predict and help compute the values of certain knot invariants. In particular, we show that neural networks are able to predict when a knot is quasipositive with a high degree of accuracy.…
Tied links and the tied braid monoid were introduced recently by the authors and used to define new invariants for classical links. Here, we give a version purely algebraic-combinatoric of tied links. With this new version we prove that the…
A simple braid is a positive braid that can be drawn so that any two strands cross at most once. We prove that as $n \to \infty$, the proportion of simple braids on $n$ strands that have positive topological entropy tends toward $100\%$.…
Given a minuscule representation of a simple Lie algebra, we find an algebraic model for the action of a regular element and show that these models can be glued together over the adjoint quotient, viewed as the set of all regular conjugacy…
This paper introduces the tensor representation of a network, here tensors are the primitive structures of the network. In view of tensor chains, two binary operations on tensor sets are defined: chain addition and reducing. Based on the…
We prove that any diagram of the unknot with c crossings may be reduced to the trivial diagram using at most (236 c)^{11} Reidemeister moves. Moreover, every diagram in this sequence has at most (7 c)^2 crossings. We also prove a similar…
A quasi-schemoid is a small category whose morphisms are colored with appropriate combinatorial data. In this note, Mitchell's embedding theorem for a tame schemoid is established. The result allows us to give a cofibrantly generated model…
A quasiconformal tree is a doubling (compact) metric tree in which the diameter of each arc is comparable to the distance of its endpoints. We show that for each integer $n\geq 2$, the class of all quasiconformal trees with uniform branch…
We establish some inequalities about the Khovanov-Rozansky cohomologies of braids. These give new upper bounds of the self-linking numbers of transversal links in standard contact $S^3$ which is sharper than the well known bound given by…
A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10- and 13-dimensional…
The class of +adequate links contains both alternating and positive links. Generalizing results of Tanaka (for the positive case) and Ng (for the alternating case), we construct fronts of an arbitrary +adequate link A so that the diagram…