Related papers: A correspondence between complexes and knots

On a smooth manifold, we associate to any closed differential form a mapping cone complex. The cohomology of this mapping cone complex can vary with the de Rham cohomology class of the closed form. We present a novel Morse theoretical…

A perfect matching cut is a perfect matching that is also a cutset, or equivalently a perfect matching containing an even number of edges on every cycle. The corresponding algorithmic problem, Perfect Matching Cut, is known to be…

This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…

It was shown by Jim Davis that a 2-component link with Alexander polynomial one is topologically concordant to the Hopf link. In this paper, we show that there is a 2-component link with Alexander polynomial one that has unknotted…

Many real-world complex networks are best modeled as bipartite (or 2-mode) graphs, where nodes are divided into two sets with links connecting one side to the other. However, there is currently a lack of methods to analyze properly such…

The graph braid group of a complete bipartite graph is the fundamental group of a configuration space of points on the graph, which is a CAT(0) cube complex. We combine an analysis of the topology of links of vertices in this complex, the…

This note explores two questions: (1) Which bigraded groups arise as the knot Floer homology of a knot in the three-sphere? (2) Given a knot, how many distinct knots share its Floer homology? Regarding the first, we show there exist…

We discuss the possibility of the existence of finite algorithms that may give distinct knot classes. In particular we present two attempts for such algorithms which seem promising, one based on knot projections on a plane, the other on…

The most tight conformations of prime knots are found with the use of the SONO algorithm. Their curvature and torsion profiles are calculated. Symmetry of the knots is analysed. Connections with the physics of polymers are discussed.

We study the group of rational concordance classes of codimension two knots in rational homology spheres. We give a full calculation of its algebraic theory by developing a complete set of new invariants. For computation, we relate these…

This manuscript introduces a new framework for the study of knots by exploring the neighborhood of knot embeddings in the space of simple open and closed curves in 3-space. The latter gives rise to a knotoid spectrum, which determines the…

We introduce and study knotoids. Knotoids are represented by diagrams in a surface which differ from the usual knot diagrams in that the underlying curve is a segment rather than a circle. Knotoid diagrams are considered up to Reidemeister…

We describe a new method for combinatorially computing the transverse invariant in knot Floer homology. Previous work of the authors and Stone used braid diagrams to combinatorially compute knot Floer homology of braid closures. However,…

A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. By [11], a hypergraph gives an associated simplicial complex. By [4], the embedded homology of a hypergraph is the homology of the infimum chain…

Examples are given to show that some compact contractible 4-manifolds can be knotted in the 4-sphere. It is then proved that any finitely presented perfect group with a balanced presentation is a knot group for an embedding of some…

Each finite and connected bipartite graph induces a finite collection of non-isomorphic dessins d'enfants, that is, $2$-cell embeddings of it into some closed orientable surface. We describe an algorithm to compute all these dessins…

Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…

Morse matchings capture the essential structural information of discrete Morse functions. We show that computing optimal Morse matchings is NP-hard and give an integer programming formulation for the problem. Then we present polyhedral…

We establish a connection between knot theory and cluster algebras via representation theory. To every knot diagram (or link diagram), we associate a cluster algebra by constructing a quiver with potential. The rank of the cluster algebra…

Knots naturally appear in continuous dynamical systems as flow periodic trajectories. However, discrete dynamical systems are also closely connected with the theory of knots and links. For example, for Pixton diffeomorphisms, the…