Related papers: Combinatorial Maps with Normalized Knot
Simple closed curves in the plane can be mapped to nontrivial knots under the action of origami foldings that allow the paper to self-intersect. We show all tame knot types may be produced in this manner, motivating the development of a new…
We resolve a case of the oriented knot complement conjecture by showing that knots in an orientable circle bundle $N$ over a genus $g \geq 2$ surface $S$ are determined by their complements. We apply this to the setting of canonical knots…
We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…
We introduce natural language processing into the study of knot theory, as made natural by the braid word representation of knots. We study the UNKNOT problem of determining whether or not a given knot is the unknot. After describing an…
We extend the renormalisation operator introduced in \cite{dCML} from period-doubling H\'enon-like maps to H\'enon-like maps with arbitrary stationary combinatorics. We show the renormalisation picture holds also holds in this case if the…
Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…
In a group, a non-trivial element is called a generalized torsion element if some non-empty finite product of its conjugates equals to the identity. We say that a knot has generalized torsion if its knot group admits such an element. For a…
In this paper, we show that contraction operations preserve the homology of $n$D generalized maps, under some conditions. Removal and contraction operations are used to propose an efficient algorithm that compute homology generators of $n$D…
In this article we extend the theory of the binary codes (the strict code $\mathcal{K}$ and the extended code $\mathcal{K}'$), associated to a projective nodal surface, to a coding theory for normal surfaces, with special consideration of…
We enumerate the state diagrams of the twist knot shadow which consist of the disjoint union of two trivial knots. The result coincides with the maximal number of regions into which the plane is divided by a given number of circles. We then…
We introduce a general theory of parametrized objects in the setting of infinity categories. Although spaces and spectra parametrized over spaces are the most familiar examples, we establish our theory in the generality of objects of a…
Several image processing tasks, such as image classification and object detection, have been significantly improved using Convolutional Neural Networks (CNN). Like ResNet and EfficientNet, many architectures have achieved outstanding…
A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…
It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…
Learning maps between data samples is fundamental. Applications range from representation learning, image translation and generative modeling, to the estimation of spatial deformations. Such maps relate feature vectors, or map between…
Given a knot K in the 3-sphere, consider a singular disk bounded by K and the intersections of K with the interior of the disk. The absolute number of intersections, minimised over all choices of singular disk with a given algebraic number…
A parity is a rule to assign labels to the crossings of knot diagrams in a way compatible with Reidemeister moves. Parity functors can be viewed as parities which provide to each knot diagram its own coefficient group that contains parities…
This work arose from efforts to generalise the usual cubical boundary by using different 'weights' for opposite faces, but still to obtain a chain complex, and this method was found to generalise. We describe a variant of the classical…
We study random knotting by considering knot and link diagrams as decorated, (rooted) topological maps on spheres and pulling them uniformly from among sets of a given number of vertices $n$, as first established in recent work with…
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…