Related papers: Notes on unknotting algorithms using normal surfac…
The observation, design and analysis of mesh-like networks in bionics, polymer physics and biological systems has brought forward an extensive catalog of fascinating structures of which a subgroup share a particular, yet critically under…
Kuperberg [Algebr. Geom. Topol. 3 (2003) 587-591] has shown that a virtual knot corresponds (up to generalized Reidemeister moves) to a unique embedding in a thichened surface of minimal genus. If a virtual knot diagram is equivalent to a…
Meier and Zupan showed that every surface in the four-sphere admits a bridge trisection and can therefore be represented by three simple tangles. This raises the possibility of applying methods from link homology to knotted surfaces. We use…
A formula that relates triple points, branch points, and their distances from infinity is presented. We recover trivial normal Euler classes for oriented surfaces, and formulas on signed triple points.
The cryptographic protocol based on topological knot theory,recently proposed by the authors, is improved for what concerns the efficiency of the encoding of knot diagrams and its error robustness. The standard Dowker-Thistlethwaite code,…
The knot group is the fundamental group of a knot or link complement. A necessary and sufficient conditions for a group to be realized as the knot group of some link was provided. This result was shown using the closed braid method.…
We consider the probability of knotting in equilateral random polygons in Euclidean 3-dimensional space, which model, for instance, random polymers. Results from an extensive Monte Carlo dataset of random polygons indicate a universal…
We propose a new method that uses deep learning techniques to solve the inverse problems. The inverse problem is cast in the form of learning an end-to-end mapping from observed data to the ground-truth. Inspired by the splitting strategy…
We establish a characterization of alternating links in terms of definite spanning surfaces. We apply it to obtain a new proof of Tait's conjecture that reduced alternating diagrams of the same link have the same crossing number and writhe.…
Charts are oriented labeled graphs in a disk. Any simple surface braid (2-dimensional braid) can be described by using a chart. Also, a chart represents an oriented closed surface (called a surface-link) embedded in 4-space. In this paper,…
Arclength continuation and branch switching are enormously successful algorithms for the computation of bifurcation diagrams. Nevertheless, their combination suffers from three significant disadvantages. The first is that they attempt to…
With the development and widespread application of digital image processing technology, image splicing has become a common method of image manipulation, raising numerous security and legal issues. This paper introduces a new splicing image…
Using unknotting number, we introduce a link diagram invariant of Hass and Nowik type, which changes at most by 2 under a Reidemeister move. As an application, we show that a certain infinite sequence of diagrams of the trivial…
The art of tying knots is exploited in nature and occurs in multiple applications ranging from being an essential part of scouting programs to engineering molecular knots. Biomolecular knots, such as knotted proteins, bear various cellular…
In this paper, we use normal surface theory to study Dehn filling on a knot-manifold. First, it is shown that there is a finite computable set of slopes on the boundary of a knot-manifold that bound normal and almost normal surfaces in a…
We adapt Seifert's algorithm for classical knots and links to the setting of tri-plane diagrams for bridge trisected surfaces in the 4-sphere. Our approach allows for the construction of a Seifert solid that is described by a Heegaard…
We seek to connect ideas in the theory of bridge trisections with other well-studied facets of classical knotted surface theory. First, we show how the normal Euler number can be computed from a tri-plane diagram, and we use this to give a…
We analyze the connections between the mathematical theory of knots and quantum physics by addressing a number of algorithmic questions related to both knots and braid groups. Knots can be distinguished by means of `knot invariants', among…
We propose and study a set of algorithms for discovering community structure in networks -- natural divisions of network nodes into densely connected subgroups. Our algorithms all share two definitive features: first, they involve iterative…
We construct an algorithm that lists all closed essential surfaces in the complement of a knot that lies on the fiber of a trefoil or figure eight knot. Such knots are Berge knots and hence admit lens space surgeries. Furthermore they may…