Related papers: Enumerating the Prime Alternating Knots, Part II

Quantum networks can enable various applications such as distributed quantum computing, long-distance quantum communication, and network-based quantum sensing with unprecedented performances. One of the most important building blocks for a…

Network coding has proved its efficiency in increasing the network performance for traditional ad-hoc networks. In this paper, we investigate using network coding for enhancing the throughput of multi-hop cognitive radio networks. We…

Tensor networks have proven to be a valuable tool, for instance, in the classical simulation of (strongly correlated) quantum systems. As the size of the systems increases, contracting larger tensor networks becomes computationally…

For every odd integer $c\ge 21$, we raise an example of a prime component-preservingly amphicheiral link with the minimal crossing number $c$. The link has two components, and consists of an unknot and a knot which is $(-)$-amphicheiral…

We prove that if an alternating 3-braid knot has unknotting number one, then there must exist an unknotting crossing in any alternating diagram of it, and we enumerate such knots. The argument combines the obstruction to unknotting number…

We make use of the 3D nature of knots and links to find savings in computational complexity when computing knot invariants such as the linking number and, in general, most finite type invariants. These savings are achieved in comparison…

The study of knot mosaics is based upon representing knot diagrams using a set of tiles on a square grid. This branch of knot theory has many unanswered questions, especially regarding the efficiency with which we draw knots as mosaics.…

Odd numbers can be indexed by the map k(n)=(n-3)/2, n belonging to 2N+3. We first propose a basic primality test using this index function that was first introduced in article (8). Input size of operations is reduced which improves…

Roberts proved that a family of alternating, arborescent, prime knots each have at least $2^{2n-1}$ distinct minimal genus Seifert surfaces, where $n$ is the genus of the knot in question. We give a subfamily of these knots that have…

We prove that the knots $13n_{592}$ and $15n_{41,127}$ both have stick number 10. These are the first non-torus prime knots with more than 9 crossings for which the exact stick number is known.

We give sharp two-sided linear bounds of the crosscap number (non-orientable genus) of alternating links in terms of their Jones polynomial. Our estimates are often exact and we use them to calculate the crosscap numbers for several…

Quantum algorithms on near-term quantum processors are typically executed using shallow quantum circuits composed of one- and two-qubit gates. However, as circuit depth and gate number increase, gate imperfections and qubit decoherence…

We present a new algorithm for iterating over all permutations of a sequence. The algorithm leverages elementary~$O(1)$ operations on recursive lists. As a result, no new nodes are allocated during the computation. Instead, all elements are…

This paper gives a complete classification of all alternating knots with tunnel number one, and all their unknotting tunnels. We prove that the only such knots are two-bridge knots and certain Montesinos knots.

We present a set of 26 finite quandles that distinguish (up to reversal and mirror image) by number of colorings, all of the 2977 prime oriented knots with up to 12 crossings. We also show that 1058 of these knots can be distinguished from…

Besides mathematical interest, knots and knot theory have important applications in physics, chemistry, and biology. Stasiak and colleagues devised a constructive method for a knot "energy" using a Metropolis Monte Carlo algorithm to…

We calculate the alternating number of torus knots with braid index 4 and less. For the lower bound, we use the upsilon-invariant recently introduced by Ozsv\'ath, Stipsicz, and Szab\'o. For the upper bound, we use a known bound for braid…

This article is devoted to the study of prime alternating +achiral knots. In the case of arborescent knots, we prove in +AAA Visibility Theorem 5.1, that the symmetry is visible on a certain projection (not necessarily minimal) and that it…

We describe an efficient algorithm to compute finite type invariants of type $k$ by first creating, for a given knot $K$ with $n$ crossings, a look-up table for all subdiagrams of $K$ of size $\lceil \frac{k}{2}\rceil$ indexed by dyadic…

We study the problem of operating a quantum switch with memory constraints. In particular, the switch has to allocate quantum memories to clients to generate link-level entanglements (LLEs), and then use these to serve end-to-end…