Search arXivSearch

arXiv · 2406.15361

Minimal grid diagrams of the prime alternating knots with 13 crossings

Abstract

A knot is a closed loop in space without self-intersection. Two knots are equivalent if there is a self homeomorphism of space bringing one onto the other. An arc presentation is an embedding of a knot in the union of finitely many half planes with a common boundary line such that each half plane contains a simple arc of the knot. The minimal number of such half planes among all arc presentations of a given knot is called the arc index of the knot. A knot is usually presented as a planar diagram with finitely many crossings of two strands where one of the strands goes over the other. A grid diagram is a planar diagram which is a non-simple rectilinear polygon such that vertical edges always cross over horizontal edges at all crossings. It is easily seen that an arc presentation gives rise to a grid diagram and vice versa. It is known that the arc index of an alternating knot is two plus its minimal crossing number. There are 4878 prime alternating knots with minimal crossing number 13. We obtained minimal arc presentations of them in the form of grid diagrams having 15 vertical segments. This is a continuation of the works on prime alternating knots of 11 crossings and 12 crossings.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hwa Jeong Lee, Alexander Stoimenow, Gyo Taek Jin. 2024-04-01. Minimal grid diagrams of the prime alternating knots with 13 crossings. https://arxiv.org/abs/2406.15361

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT