Related papers: Tabulating Knot Mosaics: Crossing Number 10 or Les…

We give the first example of a mosaic of three combinatorial designs with distinct parameters $2$-$(13,3,1)$, $2$-$(13,4,2)$, and $2$-$(13,6,5)$. Furthermore, we give examples of mosaics of $2$-$(9,3,2)$ designs that are not resolvable,…

A multi-crossing (or n-crossing) is a singular point in a projection at which n strands cross so that each strand bisects the crossing. We generalize the classic result of Kauffman, Murasugi, and Thistlethwaite, which gives the upper bound…

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…

This paper builds a novel bridge between algebraic coding theory and mathematical knot theory, with applications in both directions. We give methods to construct error-correcting codes starting from the colorings of a knot, describing…

Magic squares are well-known arrangements of integers with common row, column, and diagonal sums. Various other magic shapes have been proposed, but triangles have been somewhat overlooked. We introduce certain triangular arrangements of…

Traditional layered graph depictions such as flow charts are in wide use. Yet as graphs grow more complex, these depictions can become difficult to understand. Quilts are matrix-based depictions for layered graphs designed to address this…

We introduced concept of meander knots, 2-component meander links and multi-component meander links and derived different families of meander knots and links from open meanders with at most 16 crossings. We also defined semi-meander knots…

Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrary planar graph to index the decomposition. We prove that…

We present a table of symmetric diagrams for strongly invertible knots up to 10 crossings, point out the similarity of transvergent diagrams for strongly invertible knots with symmetric union diagrams and discuss open questions.

An $n$-crossing is a point in the projection of a knot where $n$ strands cross so that each strand bisects the crossing. An \"ubercrossing projection has a single $n$-crossing and a petal projection has a single $n$-crossing such that there…

We extend an approach of Beliakova for computing knot Floer homology and implement it in a publicly available computer program. We review the main programming and optimization methods used. Our program is then used to check that the Floer…

We address the question of detecting minimal virtual diagrams with respect to the number of virtual crossings. This problem is closely connected to the problem of detecting the minimal number of additional intersection points for a generic…

We present the complete classification of the subgroup of the classical knot concordance group generated by knots with eight or fewer crossings. Proofs are presented in summary. We also describe extensions of this work to the case of nine…

Classical knots in $\mathbb{R}^3$ can be represented by diagrams in the plane. These diagrams are formed by curves with a finite number of transverse crossings, where each crossing is decorated to indicate which strand of the knot passes…

In this paper, we show 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.

Meier and Zupan introduced bridge trisections of surface links in $S^4$ as a 4-dimensional analogue to bridge decompositions of classical links, which gives a numerical invariant of surface links called the bridge number. We prove that…

The crossing number of a graph is the minimum number of edge crossings that a graph can have when drawn in the plane. Determining this number, known as the Crossing Number problem, is a celebrated problem in combinatorial optimization. It…

We extend the concepts of trivializing and knotting numbers for knots to spatial graphs and 2-bouquet graphs, in particular. Furthermore, we calculate the trivializing and knotting numbers for projections and pseudodiagrams of 2-bouquet…

The main goal of this paper is to prove that for odd free knots - that is free knots with all odd crossings - the problem of sliceness (the existence of a spanning disc) has an explicit answer based on the pairing of the knot diagram…

Using computational techniques we tabulate prime knots up to five crossings in the solid torus and the infinite family of lens spaces $L(p,q)$. For these knots we calculate the second and third skein module and establish which prime knots…