相关论文: Solving Infinite Kolam in Knot Theory
The Collatz sequence for a given natural number $N$ is generated by repeatedly applying the map $N$ $\rightarrow$ $3N+1$ if $N$ is odd and $N$ $\rightarrow$ $N/2$ if $N$ is even. One elusive open problem in Mathematics is whether all such…
We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…
We construct an infinite collection of knots with the property that any knot in this family has $n$-string essential tangle decompositions for arbitrarily high $n$.
Edge-coloring problems with forbidden patterns are decision problems asking to find an edge-coloring of the input graph which avoids a homomorphism from a fixed forbidden family of edge-colored graphs. In the precolored version of these…
Knot theory is the study of isotopy classes of embeddings of the circle $S^1$ into a 3-manifold, specifically $R^3$. The F\'ary-Milnor Theorem says that any curve in $R^3$ of total curvature less than $4\pi$ is unknotted. More generally, a…
The primary objects of study in the ``knot theory of complex plane curves'' are C-links: links (or knots) cut out of a 3-sphere in the complex plane by complex plane transverse and totally tangential. Transverse C-links are naturally…
In [8], K. Kaur, S. Kamada et al. posed a problem of finding a virtual knot, if exists, with an unknotting index (n,m), where (n,m) is a pair of non-negative integers. In this paper, we address this question by providing infinite families…
We identify a structural pattern in the construction of known infinite families of trees whose independence polynomials are not log-concave. Using this pattern and properties of polynomial ring ideals, we derive linear recurrences for these…
Nondango is a pencil puzzle consisting of a rectangular grid partitioned into regions, with some cells containing a white circle. The player has to color some circles black such that every region contains exactly one black circle, and there…
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some…
Knot Floer homology is a knot invariant defined using holomorphic curves. In more recent work, taking cues from bordered Floer homology,the authors described another knot invariant, called "bordered knot Floer homology", which has an…
Recently, connections have been explored between the complexity of finite problems in graph theory and the complexity of their infinite counterparts. As is shown in our paper (and in independent work of Tirza Hirst and D. Harel from a…
This paper describes several new problems and ideas concerning algebraic geometry and complexity theory. It first uses the idea of coloring graphs with elements of finite fields. This procedure then shows that graph coloring problems can be…
We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number of vertices in each subgraph is minimized. We prove NP-completeness of the problem, prove lower bounds, and give approximation…
We study hyperplane covering problems for finite grid-like structures in $\mathbb{R}^d$. We call a set $\mathcal{C}$ of points in $\mathbb{R}^2$ a conical grid if the line $y = a_i$ intersects $\mathcal{C}$ in exactly $i$ points, for some…
In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $\rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $i\in\{1,\ldots,u\}$ of binary (respectively, extended…
A singular knot is an immersed circle in $\mathbb R^{3}$ with finitely many transverse double points. The study of singular knots was initially motivated by the study of Vassiliev invariants. Namely, singular knots give rise to a decreasing…
We show that for any nontrivial knot $K$ and any natural number $n$ there is a diagram $D$ of $K$ such that the unknotting number of $D$ is greater than or equal to $n$. It is well known that twice the unknotting number of $K$ is less than…
We extend the theory of Vassiliev (or finite type) invariants for knots to knotoids using two different approaches. Firstly, we take closures on knotoids to obtain knots and we use the Vassiliev invariants for knots, proving that these are…
We prove that certain problems naturally arising in knot theory are NP--hard or NP--complete. These are the problems of obtaining one diagram from another one of a link in a bounded number of Reidemeister moves, determining whether a link…