相关论文: Algorithms for recognizing knots and 3-manifolds

Methods from computational topology are becoming more and more popular in computer vision and have shown to improve the state-of-the-art in several tasks. In this paper, we investigate the applicability of topological descriptors in the…

Mapper and Ball Mapper are Topological Data Analysis tools used for exploring high dimensional point clouds and visualizing scalar-valued functions on those point clouds. Inspired by open questions in knot theory, new features are added to…

This paper formulates a generalization of our work on quantum knots to explain how to make quantum versions of algebraic, combinatorial and topological structures. We include a description of previous work on the construction of Hilbert…

This is an exposition of results on the existence problem of $\pi_1$-injective immersed and embedded surfaces in graph-manifolds, and also of nonpositively curved metrics on graph-manifolds, obtained by different authors. The results are…

A problem about Khovanov homology and 3-manifolds is discussed in this paper.

The crosscap number of a knot is an invariant describing the non-orientable surface of smallest genus that the knot bounds. Unlike knot genus (its orientable counterpart), crosscap numbers are difficult to compute and no general algorithm…

Deep learning has been successfully applied to the segmentation of 3D Computed Tomography (CT) scans. Establishing the credibility of these segmentations requires uncertainty quantification (UQ) to identify untrustworthy predictions. Recent…

Knots are intricate structures that cannot be unambiguously distinguished with any single topological invariant. Momentum space knots, in particular, have been elusive due to their requisite finely tuned long-ranged hoppings. Even if…

The disk complex of a surface in a 3-manifold is used to define its {\it topological index}. Surfaces with well-defined topological index are shown to generalize well-known classes, such as incompressible, strongly irreducible, and critical…

Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…

A dual description of 3-dimensional topological Seiberg-Witten theory in terms of the Alexander invariant on manifolds obtained via surgery on a knot is proposed. The description directly follows from a low-energy analysis of the…

Two distinct knots are said to be friends if their complements, filled along the 0-slope, produce diffeomorphic 3-manifolds. In this article, we develop a practical algorithm, implemented using SnapPy and Regina, to search for a friend of a…

We generalize H. Seifert's algorithm for finding a Seifert surface for a knot or link. The generalization applies to "framed oriented measured lamination links." For knots, a Seifert surface determines a unique framing. In our setting, we…

While the problem of knot classification is far from solved, it is possible to create computer programs that can be used to tabulate knots up to a desired degree of complexity. Here we discuss the main ideas on which such programs can be…

We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…

A clear understanding of topology of higher-dimensional objects is important in many branches of both pure and applied mathematics. In this survey we attempt to present some results of higher-dimensional topology in a way which makes clear…

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…

Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…

We test the efficiency of applying Geometric Deep Learning to the problems in low-dimensional topology in a certain simple setting. Specifically, we consider the class of 3-manifolds described by plumbing graphs and use Graph Neural…

Despite significant advances in the field of deep learning in applications to various fields, explaining the inner processes of deep learning models remains an important and open question. The purpose of this article is to describe and…