3 problems

Let a free knot diagram be given, and let a nontrivial knot be a knot other than the unknot. The resultant knot probability is the proportion of crossing assignments of the free kn…

A free $2n$ knot is the free knot diagram referred to in the source, with $n+2$ crossings. A minimal free knot diagram is one with the minimum crossing number for its knot. $2n$-un…

Let a free $2m$ diagram denote the free closure of the $2m$-tangle referred to in the source. A free diagram with $m$ crossings is considered sufficiently complicated as in the sou…