相关论文: Is a Knot Classification possible?
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…
In a previous paper (q-alg/9501022) we suggested some algorithms that could be useful in solving the problem of knot classification. Here we continue this discussion by answering questions raised in that paper and by commenting on practical…
I briefly discuss a method of obtaining distinct classes of topologically equivalent knots by developing appropriate computer programs.
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…
In this paper we summarise the work discussed in Ref. [1] and [2] (q-alg/9505003), in which we introduced a method helpful in solving the problem of knot classification. We also present results obtained since then.
We state the Problem of Knot Identification as a way to achieve consensus in dynamic networks. The network adversary is asynchronous and not oblivious. The network may be disconnected throughout the computation. We determine the necessary…
Knots and links which are closed 3-braids are a very special class. Like 2-bridge knots and links, they are simple enough to admit a complete classification. At the same time they are rich enough to serve as a source of examples on which,…
This is a survey paper on algorithms for solving problems in 3-dimensional topology. In particular, it discusses Haken's approach to the recognition of the unknot, and recent variations.
This work proposes a taxonomy for diagnosis computation methods which allows their standardized assessment, classification and comparison. The aim is to (i) give researchers and practitioners an impression of the diverse landscape of…
We construct a new type of geometric knot theory, plumbers' knots, and solve the problems of distinguishing and enumerating such knots at a fixed level of complexity. (v2) Minor edits, added theorem 3.18. (v3) Substantial revisions,…
We analyze the connections between the mathematical theory of knots and quantum physics by addressing a number of algorithmic questions related to both knots and braid groups. Knots can be distinguished by means of `knot invariants', among…
Two algorithms for construction of all closed knight's paths of lengths up to 16 are presented. An approach for classification (up to equivalence) of all such paths is considered. By applying the construction algorithms and classification…
The first and last named authors have demonstrated the existence of knots for which every integral slope is non-characterizing. In this short note, we extend this result in two ways. There exists a knot that shares for every integer n the…
The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…
Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…
We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that it lies in a plane. We show that this problem, {\sc…
A polynomial is presented that models a topological knot in a unique manner. It distinguishes all types of knots including the orientation and has a group theory interpretation. The topologies may be labeled via a number, which upon a base…
This paper considers the problem of algorithm selection for community detection. The aim of community detection is to identify sets of nodes in a network which are more interconnected relative to their connectivity to the rest of the…
This is a report on our ongoing research on a combinatorial approach to knot recognition, using coloring of knots by certain algebraic objects called quandles. The aim of the paper is to summarize the mathematical theory of knot coloring in…
The list of knots with up to 10 crossings is commonly referred to as the Rolfsen Table. This paper presents a way to generate the Rolfsen table in a simple, clear, and reproducible manner. The methods we use are similar to those used by J.…