Related papers: Enumerating the Prime Alternating Knots, Part II
Priority queues are fundamental abstract data structures, often used to manage limited resources in parallel programming. Several proposed parallel priority queue implementations are based on skiplists, harnessing the potential for…
Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram…
It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be…
Implementing embedded neural network processing at the edge requires efficient hardware acceleration that couples high computational performance with low power consumption. Driven by the rapid evolution of network architectures and their…
It is known that each of the successive quotient groups of the grope and solvable filtrations of the knot concordance group has an infinite rank subgroup. The generating knots of these subgroups are constructed using iterated doubling…
A knot in the three-sphere is doubly slice if it is the cross-section of an unknotted two-sphere in the four-sphere. For low-crossing knots, the most complete work to date gives a classification of doubly slice knots through 9 crossings. We…
We define the {\it Wirtinger number} of a link, an invariant closely related to the meridional rank. The Wirtinger number is the minimum number of generators of the fundamental group of the link complement over all meridional presentations…
We present experimental results approximating the Jones polynomial using 4 qubits in a liquid state nuclear magnetic resonance quantum information processor. This is the first experimental implementation of a complete problem for the…
The model of a topological quantum computer is a promising one due to its natural resistance to noise and other errors. Operations in such a computer are implemented by braiding the trajectories of anyons. While it is easy to understand how…
A well-known conjecture in knot theory says that the percentage of hyperbolic knots amongst all of the prime knots of $n$ or fewer crossings approaches $100$ as $n$ approaches infinity. In this paper, it is proved that this conjecture…
We implement a quantum protocol for prime number identification based on entanglement dynamics, using IBM quantum processors. The method links the primality of an integer to specific Fourier components extracted from the time evolution of…
Neural networks with rectified linear unit activations are essentially multivariate linear splines. As such, one of many ways to measure the "complexity" or "expressivity" of a neural network is to count the number of knots in the spline…
Counting triangles in a graph and incident to each vertex is a fundamental and frequently considered task of graph analysis. We consider how to efficiently do this for huge graphs using massively parallel distributed-memory machines.…
We use Heegaard Floer homology to give obstructions to unknotting a knot with a single crossing change. These restrictions are particularly useful in the case where the knot in question is alternating. As an example, we use them to classify…
We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…
The computer artificial intelligence system AlphaFold has recently predicted previously unknown three-dimensional structures of thousands of proteins. Focusing on the subset with high-confidence scores, we algorithmically analyze these…
We revisit the issue of the existence of infinitely many distinct prime knots with the same Alexander invariant. We present infinitely many distinct families, each family made up of infinitely many distinct knots. Within each family, the…
In this paper, we give the trivializing number of all minimal diagrams of positive 2-bridge knots, and study the relation between the trivializing number and the unknotting number for a part of these knots.
Minimum braids are a complete invariant of knots and links. This paper defines minimum braids, describes how they can be generated, presents tables for knots up to ten crossings and oriented links up to nine crossings, and uses minimum…
We have the generating function which determines the number of $2$-bridge knot groups admitting epimorphisms onto the knot group of a given $2$-bridge knot, in terms of crossing number. In this paper, we will refine this formula by taking…