Related papers: Developing Computer Programs for Knot Classificati…

We observe that any knot invariant extends to virtual knots. The isotopy classification problem for virtual knots is reduced to an algebraic problem formulated in terms of an algebra of arrow diagrams. We introduce a new notion of finite…

This is a survey of the exciting recent progress made in understanding the complexity of distributed subgraph finding problems. It overviews the results and techniques for assorted variants of subgraph finding problems in various models of…

Knot diagrams are among the most common visual tools in topology. Computer programs now make it possible to draw, manipulate and render them digitally, which proves to be useful in knot theory teaching and research. Still, an openly…

We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…

We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…

This is survey about the classical knot concordance group, prepared for an upcoming handbook of knot theory. Topics include: the basic definitions of concordance; the theory of algebraic concordance as developed by Levine; the theory of…

Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the underlying LP problem. In this paper, we…

This paper is an introduction to the subject of virtual knot theory, combined with a discussion of some specific new theorems about virtual knots. The new results are as follows: We prove, using a 3-dimensional topology approach that if a…

We consider the graph link prediction task, which is a classic graph analytical problem with many real-world applications. With the advances of deep learning, current link prediction methods commonly compute features from subgraphs centered…

In this paper, we consider the knot matching problem arising in computational forestry. The knot matching problem is an important problem that needs to be solved to advance the state of the art in automatic strength prediction of lumber. We…

We automate the process of machine learning correlations between knot invariants. For nearly 200,000 distinct sets of input knot invariants together with an output invariant, we attempt to learn the output invariant by training a neural…

We consider four approaches to the analysis of cuts in ordered abelian groups and ordered fields, their interconnection, and various applications. The notions we discuss are: ball cuts, invariance group, invariance valuation ring, and cut…

Using derived categories of equivariant coherent sheaves, we construct a categorification of the tangle calculus associated to sl(2) and its standard representation. Our construction is related to that of Seidel-Smith by homological mirror…

We state a combinatorial optimization problem whose feasible solutions define both a decomposition and a node labeling of a given graph. This problem offers a common mathematical abstraction of seemingly unrelated computer vision tasks,…

The unification problem in algebras capable of describing sets has been tackled, directly or indirectly, by many researchers and it finds important applications in various research areas--e.g., deductive databases, theorem proving, static…

Knots, links and entangled filaments appear in many physical systems of interest in biology and engineering. Classifying knots and measuring entanglement is of interest both for advancing knot theory, as well as for analyzing large data…

We introduce a "deformation" of plumbing. We also define a structure of data used in a calculation by computer aid of the crosscap numbers of alternating knots.

We show that the problem of deciding whether a knot in a fixed closed orientable 3-dimensional manifold bounds a surface of genus at most $g$ is in co-NP. This answers a question of Agol, Hass, and Thurston in 2002. Previously, this was…

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…

This paper starts a systematic description of colored knot polynomials, beginning from the first non-(anti)symmetric representation R=[2,1]. The project involves several steps: (i) parametrization of big families of knots a la…