Related papers: Computing a Knot Invariant as a Constraint Satisfa…
While the problem of knot classification is far from solved, it is possible to create computer programs that can be used to tabulate knots up to a desired degree of complexity. Here we discuss the main ideas on which such programs can be…
Symmetry of geometrical figures is reflected in regularities of their algebraic invariants. Algebraic regularities are often preserved when the geometrical figure is topologically deformed. The most natural, intuitively simple but…
We study a simple and exactly solvable model for the generation of random satisfiability problems. These consist of $\gamma N$ random boolean constraints which are to be satisfied simultaneously by $N$ logical variables. In…
The slope is an isotopy invariant of colored links with a distinguished component, initially introduced by the authors to describe an extra correction term in the computation of the signature of the splice. It appeared to be closely related…
This chapter delves into the realm of computational complexity, exploring the world of challenging combinatorial problems and their ties with statistical physics. Our exploration starts by delving deep into the foundations of combinatorial…
State-sum invariants for knotted curves and surfaces using quandle cohomology were introduced by Laurel Langford and the authors in math.GT/9903135 In this paper we present methods to compute the invariants and sample computations. Computer…
We analyse the perturbative expansion of the knot invariants defined from the unitary representations of the Quantum Lorentz Group in two different ways, namely using the Kontsevich Integral and weight systems, and the $R$-matrix in the…
We define an invariant of welded virtual knots from each finite crossed module by considering crossed module invariants of ribbon knotted surfaces which are naturally associated with them. We elucidate that the invariants obtained are non…
Spin glass systems as lattices of disordered magnets with random interactions have important implications within the theory of magnetization and applications to a wide-range of hard combinatorial optimization problems. Nevertheless, despite…
We classify nonnegatively curved simply connected 4-manifolds with circle symmetry up to equivariant diffeomorphisms. The main problem is rule out knotted curves in the singular set of the orbit space. As an extension of this work we…
We study here several variants of the covariates fine balance problem where we generalize some of these problems and introduce a number of others. We present here a comprehensive complexity study of the covariates problems providing…
In this article we take up the calculation of the minimum number of colors needed to produce a non-trivial coloring of a knot. This is a knot invariant and we use the torus knots of type (2, n) as our case study. We calculate the minima in…
The paper introduces Slope Conjecture which relates the degree of the Jones polynomial of a knot and its parallels with the slopes of incompressible surfaces in the knot complement. More precisely, we introduce two knot invariants, the…
Ozsv\'ath and Szab\'o used the knot filtration on $\widehat{CF}(S^3)$ to define the $\tau$-invariant for knots in the 3-sphere. In this article, we generalize their construction and define a collection of $\tau$-invariants associated to a…
Recently, big data techniques such as machine learning and topological data analysis have made their way to theoretical mathematics. Motivated by the recent work with polynomial invariants for knots, we use manifold learning and topological…
We give three algorithms to determine the crosscap number of a knot in the 3-sphere using $0$-efficient triangulations and normal surface theory. Our algorithms are shown to be correct for a larger class of complements of knots in closed…
We study interactions between Skolem Arithmetic and certain classes of Constraint Satisfaction Problems (CSPs). We revisit results of Glass er et al. in the context of CSPs and settle the major open question from that paper, finding a…
The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway…
We apply Bayesian optimization and reinforcement learning to a problem in topology: the question of when a knot bounds a ribbon disk. This question is relevant in an approach to disproving the four-dimensional smooth Poincar\'e conjecture;…
A Boolean constraint satisfaction instance is a conjunction of constraint applications, where the allowed constraints are drawn from a fixed set B of Boolean functions. We consider the problem of determining whether two given constraint…