Related papers: Hard diagrams of split links
Knots are intricate structures that cannot be unambiguously distinguished with any single topological invariant. Momentum space knots, in particular, have been elusive due to their requisite finely tuned long-ranged hoppings. Even if…
In an earlier paper we introduced rectangular diagrams of surfaces and showed that any isotopy class of a surface in the three-sphere can be presented by a rectangular diagram. Here we study transformations of those diagrams and introduce…
We introduce multi-tribrackets, algebraic structures for region coloring of diagrams of knots and links with different operations at different kinds of crossings. In particular we consider the case of component multi-tribrackets which have…
We construct a new spectral sequence beginning at the Khovanov homology of a link and converging to the Khovanov homology of the disjoint union of its components. The page at which the sequence collapses gives a lower bound on the splitting…
Clustering is one of the fundamental tasks in data analytics and machine learning. In many situations, different clusterings of the same data set become relevant. For example, different algorithms for the same clustering task may return…
In the United States, regions are frequently divided into districts for the purpose of electing representatives. How the districts are drawn can affect who's elected, and drawing districts to give an advantage to a certain group is known as…
Links in lens spaces may be defined to be equivalent by ambient isotopy or by diffeomorphism of pairs. In the first case, for all the combinatorial representations of links, there is a set of Reidemeister-type moves on diagrams connecting…
Boring is an operation which converts a knot or two-component link in a 3--manifold into another knot or two-component link. It generalizes rational tangle replacement and can be described as a type of 2--handle attachment. Sutured manifold…
Symmetries of knots have been studied extensively, and strongly invertible knots are one of them. Lamm defined the equivariant crossing number $c_t(K)$, the minimum crossing number among all symmetric diagrams for a strongly invertible knot…
Two links are called link-homotopic if they are transformed to each other by a sequence of self-crossing changes and ambient isotopies. The notion of link-homotopy is generalized to spatial graphs and it is called component-homotopy. The…
We describe a method for generating minimal hard prime surface-link diagrams. We extend the known examples of minimal hard prime classical unknot and unlink diagrams up to three components and generate figures of all minimal hard prime…
It is known that each knot has a semimeander diagram (i. e. a diagram composed of two smooth simple arcs), however the number of crossings in such a diagram can only be roughly estimated. In the present paper we provide a new estimate of…
We define a decomposition of link projections whose pieces we call atoroidal graphs. We describe a surgery operation on these graphs and show that all atoroidal graphs can be generated by performing surgery repeatedly on a family of well…
Twisted diagrams are "diagrams" with components in different categories. Structure maps are defined using auxiliary data which consists of functors relating the various categories to each other. Prime examples of the construction are…
We study the enumeration of alternating links and tangles, considered up to topological (flype) equivalences. A weight $n$ is given to each connected component, and in particular the limit $n\to 0$ yields information about (alternating)…
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 extend Milnor's mu-invariants of link homotopy to ordered (classical or virtual) tangles. Simple combinatorial formulas for mu-invariants are given in terms of counting trees in Gauss diagrams. Invariance under Reidemeister moves…
We describe a new class of minimal link diagrams. This class includes certain alternating diagrams, the standard diagrams of all torus links, and numerous homogeneous diagrams whose minimality has not been proven before. Besides, we…
Recently, Dasbach, Futer, Kalfagianni, Lin, and Stoltzfus extended the notion of a Tait graph by associating a set of ribbon graphs (or equivalently, embedded graphs) to a link diagram. Here we focus on Seifert graphs, which are the ribbon…
Several interesting approaches have been reported in the literature on complex networks, random walks, and hierarchy of graphs. While many of these works perform random walks on stable, fixed networks, in the present work we address the…