相关论文: Solving Infinite Kolam in Knot Theory

Pulli kolam is a ubiquitous art form in south India. It involves drawing a line looped around a collection of dots (pullis) place on a plane such that three mandatory rules are followed: all line orbits should be closed, all dots are…

Pulli Kolam is an ancient mathematical artform that is still practiced today in south India by over a quarter million people. "Pulli" in the Tamil language means dots. A specific type of pulli kolam is "sikku" kolam where a series of dots…

This paper extends Hridaya Kolam patterns to cases where the number of dots ($m$) and arms ($n$) are not coprime, i.e., $\gcd(m, n) \ne 1$. Such configurations give rise to multiple disjoint closed loops. We propose a…

This study extends the mathematical framework of Hridaya Kolam patterns by applying modular arithmetic to even-ordered dot arrangements with arm counts co-prime to the number of dots. We analyze the resulting cyclic sequences that…

Let $D$ be a knot diagram, and let ${\mathcal D}$ denote the set of diagrams that can be obtained from $D$ by crossing exchanges. If $D$ has $n$ crossings, then ${\mathcal D}$ consists of $2^n$ diagrams. A folklore argument shows that at…

We determine p-colorability of the paradromic rings. These rings arise by generalizing the well-known experiment of bisecting a Mobius strip. Instead of joining the ends with a single half twist, use $m$ twists, and, rather than bisecting…

This article is about applications of linear algebra to knot theory. For example, for odd prime p, there is a rule (given in the article) for coloring the arcs of a knot or link diagram from the residues mod p. This is a knot invariant in…

A c-coloring of G(n,m)=n x m is a mapping of G(n,m) into {1,...,c} such that no four corners forming a rectangle have the same color. In 2009 a challenge was proposed via the internet to find a 4-coloring of G(17,17). This attracted…

Inspired by the $S^n$ colored version of Khovanov and Khovanov-Rozansky homology, we define a colored version of knot Floer homology by studying the colimit of a directed system of link Floer homology with infinite full twists.…

A covering with dominoes of a rectilinear region is called \emph{tatami} if no four dominoes meet at any point. We describe a reduction from planar 3SAT to Domino Tatami Covering. As a consequence it is NP-complete to decide whether there…

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

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…

By a fixed continuous map from a $3$-space to itself, a knot in the $3$-space may be mapped to another knot in the $3$-space. We analyze possible knot types of them. Then we map a knot repeatedly by a fixed continuous map and analyze…

Sudoku grids can be thought of as graphs where the vertices are the squares of the grid, and edges join vertices in the same row, column, or sub-grid. A Sudoku puzzle corresponds to a partial proper coloring of the Sudoku graph. We provide…

A grid drawing of a graph maps vertices to grid points and edges to line segments that avoid grid points representing other vertices. We show that there is a number of grid points that some line segment of an arbitrary grid drawing must…

The subset sum problem over finite fields is a well-known {\bf NP}-complete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study the number of solutions of the subset sum problem from a…

A knot is an an embedding of a circle into three-dimensional space. We say that a knot is unknotted if there is an ambient isotopy of the embedding to a standard circle. By representing knots via planar diagrams, we discuss the problem of…

We construct two complete invariants of oriented classical knots in space. The value of each invariant on any knot is a set, infinite for the first invariant and finite for the second. The finite set is computed algorithmically from any…

We provide a way to produce knots in $S^3$ from signed chord diagrams, and prove that every knot can be produced in this way. Using these diagrams, we generalize the fundamental theorem of finite type invariants. We also provide moves for…

We undertake a detailed investigation into the structure of permutations in monotone grid classes whose row-column graphs do not contain components with more than one cycle. Central to this investigation is a new decomposition, called the…