Related papers: Space-Efficient Prime Knot 7-Mosaics

Recently Iltgen, Lewark and Marino introduced the concept of a proper rational tangle replacement and the corresponding notion of the proper rational unknotting number. In this note we derive a version of the Montesinos trick for proper…

In this paper we study how randomly generated knots occupy a volume of space using topological methods. To this end, we consider the evolution of the first homology of an immersed metric neighbourhood of a knot's embedding for growing…

This is the first of three papers that refine and extend portions of our earlier preprint, "Depth of a knot tunnel." Together, they rework the entire preprint. H. Goda, M. Scharlemann, and A. Thompson described a general construction of all…

We look at sets of tiles that can tile any region of size greater than 1 on the square grid. This is not the typical tiling question, but relates closely to it and therefore can help solve other tiling problems -- we give an example of…

One of the very first results about designs over finite fields, by S. Thomas, is the existence of a cyclic 2-$(n,3,7)$ design over $\mathbb{F}_{2}$ for every integer $n$ coprime with 6. Here, by means of difference methods, we reprove and…

We consider the notion of mosaic diagrams for surface-links using marked graph diagrams. We establish bounds, in some cases tight, on the mosaic numbers for the surface-links with ch-index up to 10. As an application, we use mosaic diagrams…

In this paper, we consider the knot complement problem for not null-homologous knots in homology lens spaces. Let $M$ be a homology lens space with $H_1(M; \mathbb{Z}) \cong \mathbb{Z}_p$ and $K$ a not null-homologous knot in $M$. We show…

Let $k\ge 1$ be an integer, and let $P= (f_1(x), \ldots, f_k(x) )$ be $k$ admissible linear polynomials over the integers, or \textit{the pattern}. We present two algorithms that find all integers $x$ where $\max{ \{f_i(x) \} } \le n$ and…

Reliable and robust methods of predicting the crystal structure of a compound, based only on its chemical composition, is crucial to the study of materials and their applications. Despite considerable ongoing research efforts, crystal…

In this paper we present a systematic method to generate prime knot and prime link minimal triple-point projections, and then classify all classical prime knots and prime links with triple-crossing number at most four. We also extend the…

We give a criterion for distinguishing a prime knot $K$ in $S^3$ from every other knot in $S^3$ using the finite quotients of $\pi_1(S^3\setminus K)$. Using recent work of Baldwin-Sivek, we apply this criterion to the hyperbolic knots…

This work explores the relationship between solution space and time complexity in the context of the $\textbf{P}$ vs. $\textbf{NP}$ problem, particularly through the lens of the sliding tile puzzle and root finding algorithms. We focus on…

We present knot primality tests that are built from knot Floer homology. The most basic of these is a simply stated and elementary consequence of Heegaard Floer theory: if the two-variable knot Floer polynomial of a knot K is irreducible,…

We introduce KnotMosaics, a SageMath package for constructing, visualizing, and analyzing knot mosaic diagrams. The package represents an n-mosaic as a matrix of standard tile labels and implements the local connectivity rules needed to…

In this paper we study algorithms for tiling problems. We show that the conditions $(T1)$ and $(T2)$ of Coven and Meyerowitz, conjectured to be necessary and sufficient for a finite set $A$ to tile the integers, can be checked in time…

We propose a novel, good-quality, and less demanding method for detecting knots on the surface of wooden logs using multimodal data fusion. Knots are a primary factor affecting the quality of sawn timber, making their detection fundamental…

Efficient indexing is fundamental for multi-dimensional data management and analytics. An emerging tendency is to directly learn the storage layout of multi-dimensional data by simple machine learning models, yielding the concept of Learned…

We say that a tile is $\sigma$-morphic if it tiles the plane in exactly $\aleph_0$ many noncongruent ways (up to an isometry). It is an unsolved problem of whether a $\sigma$-morphic tile exist in the plane. In this note we present a…

We present an algorithm for computing the prime factorisation of a knot, which is practical in the following sense: using Regina, we give an implementation that works well for inputs of reasonable size, including prime knots from the…

In this paper it was shown that all prime numbers lie on 96 half-lines. At the same time, it was shown that if a given number does not lie on any of the above half-lines, then it is a composite number. A corresponding linear mathematical…