English
Related papers

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

200 papers

Many invariants of knots rely upon smoothing the knot at its crossings. To compute them, it is necessary to know how to count the number of connected components the knot diagram is broken into after the smoothing. In this paper, it is shown…

Geometric Topology · Mathematics 2013-04-01 Micah W. Chrisman

In areas as diverse as contemporary art, play structures, climbing equipment, and modular construction toys, we see the presence of building block-like polyhedral complexes, which are generalizations of the pieces in the game Tetris. We…

Combinatorics · Mathematics 2026-02-27 Bert Dobbelaere , Peter Kagey , Drake Thomas , Andrés R. Vindas-Meléndez

The twisting number of a ribbon knot $K$ is the minimal number of tangle replacements on the symmetry axis of $J \# -J$ for any knot $J$ that is required to produce a symmetric union diagram of $K$. We prove that the twisting number is…

Geometric Topology · Mathematics 2024-06-24 Vitalijs Brejevs , Peter Feller

In this article we discuss applications of neural networks to recognising knots and, in particular, to the unknotting problem. One of motivations for this study is to understand how neural networks work on the example of a problem for which…

Geometric Topology · Mathematics 2022-11-28 L. H. Kauffman , N. E. Russkikh , I. A. Taimanov

The lattice stick number of a knot type is defined to be the minimal number of straight line segments required to construct a polygon presentation of the knot type in the cubic lattice. In this paper, we mathematically prove that the…

Geometric Topology · Mathematics 2015-12-14 Youngsik Huh , Seungsang Oh

We introduce a new numerical knot invariant, termed the \textit{segment number}, which is derived from partitioned knot diagrams subject to specific over/under-crossing constraints. We prove that a knot is non-trivial if and only if its…

Geometric Topology · Mathematics 2026-02-19 Makoto Ozawa

We show that for every fixed non-negative integer k there is a quadratic time algorithm that decides whether a given graph has crossing number at most k and, if this is the case, computes a drawing of the graph in the plane with at most k…

Data Structures and Algorithms · Computer Science 2007-05-23 Martin Grohe

Binary representations of the trefoil and other knots of up to ten crossings in the simple cubic lattice were created. The BiEntropy of each knot was computed using a variety of binary encodings and compared against controls. This showed…

General Mathematics · Mathematics 2018-02-13 Grenville J. Croll

There are 46,972 prime knots with crossing number 14. Among them 19,536 are alternating and have arc index 16. Among the non-alternating knots, 17, 477, and 3,180 have arc index 10, 11, and 12, respectively. The remaining 23,762 have arc…

A problem that arises in drawings of transportation networks is to minimize the number of crossings between different transportation lines. While this can be done efficiently under specific constraints, not all solutions are visually…

Data Structures and Algorithms · Computer Science 2013-06-25 Martin Fink , Sergey Pupyrev

Knot colorings are one of the simplest ways to distinguish knots, dating back to Reidemeister, and popularized by Fox. In this mostly expository article, we discuss knot invariants like colorability, knot determinant and number of…

Geometric Topology · Mathematics 2019-10-18 Sudipta Kolay

Several articles deal with tilings with squares and dominoes on 2-dimensional boards, but only a few on boards in 3-dimensional space. We examine a tiling problem with colored cubes and bricks of $(2\times2\times n)$-board in three…

Combinatorics · Mathematics 2021-04-01 László Németh

We say that a link $L_1$ is an s-major of a link $L_2$ if any diagram of $L_1$ can be transformed into a diagram of $L_2$ by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime…

Geometric Topology · Mathematics 2008-06-24 Toshiki Endo , Tomoko Itoh , Kouki Taniyama

Given a group endowed with a Z/2-valued morphism we associate a Gauss diagram theory, and show that for a particular choice of the group these diagrams encode faithfully virtual knots on a given arbitrary surface. This theory contains all…

Geometric Topology · Mathematics 2014-03-17 Arnaud Mortier

We study the minimum ribbonlength for immersed planar ribbon knots and links. Our approach is to embed the space of such knots and links into a larger more tractable space of disk diagrams. When length minimisers in disk diagram space are…

Geometric Topology · Mathematics 2025-10-23 José Ayala , David Kirszenblat , J. Hyam Rubinstein

We use grid diagrams to give a combinatorial algorithm for computing the knot Floer homology of the pullback of a knot K in its m-fold cyclic branched cover Sigma^m(K), and we give computations when m=2 for over fifty three-bridge knots…

Geometric Topology · Mathematics 2016-01-20 Adam Simon Levine

We present a practical algorithm to determine the minimal genus of non-orientable spanning surfaces for 2-bridge knots, called the crosscap numbers. We will exhibit a table of crosscap numbers of 2-bridge knots up to 12crossings (all 362 of…

Geometric Topology · Mathematics 2007-05-23 Mikami Hirasawa , Masakazu Teragaito

Digital mosaics have usually used regular tiles, simulating the historical "tessellated" mosaics. In this paper, we present a method for synthesizing pebble mosaics, a historical mosaic style in which the tiles are rounded pebbles. We…

Graphics · Computer Science 2019-02-11 Lars Doyle , Forest Anderson , Ehren Choy , David Mould

A knotted ribbon is one of physical aspect of a knot. A folded ribbon knot is a depiction of a knot obtained by folding a long and thin rectangular strip to become flat. The ribbonlength of a knot type can be defined as the minimum length…

Geometric Topology · Mathematics 2026-02-25 Hyoungjun Kim , Sungjong No , Hyungkee Yoo

Network motif provides a way to uncover the basic building blocks of most complex networks. This task usually demands high computer processing, specially for motif with 5 or more vertices. This paper presents an extended methodology with…

Data Structures and Algorithms · Computer Science 2018-04-27 Luis A. A. Meira , Vinícius R. Máximo , Alvaro L. Fazenda , Arlindo F. da Conceição