Related papers: The computational complexity of the solid torus co…
We consider the Densest-Subgraph problem, where a graph and an integer k is given and we search for a subgraph on exactly k vertices that induces the maximum number of edges. We prove that this problem is NP-hard even when the input graph…
The long standing issue known as the hot QCD collinear singularity problem has been proven to rely on an incorrect sequence of two mathematical operations. Here, the original derivation of this problem is entirely revisited within the…
Long, flexible physical filaments are naturally tangled and knotted, from macroscopic string down to long-chain molecules. The existence of knotting in a filament naturally affects its configuration and properties, and may be very stable or…
In the paper where he first defined Communication Complexity, Yao asks: \emph{Is computing $CC(f)$ (the 2-way communication complexity of a given function $f$) NP-complete?} The problem of deciding whether $CC(f) \le k$, when given the…
We show that any non-minimal bridge decomposition of a torus knot is stabilized and that $n$-bridge decompositions of a torus knot are unique for any integer $n$. This implies that a knot in a bridge position is a torus knot if and only if…
We conjecture that the stable Khovanov homology of torus knots can be described as the Koszul homology of an explicit non-regular sequence of quadratic polynomials. The corresponding Poincare series turns out to be related to the…
The backbone of most proteins forms an open curve. To study their entanglement, a common strategy consists in searching for the presence of knots in their backbones using topological invariants. However, this approach requires to close the…
Understanding the structure of high-dimensional data is fundamental to neuroscience and other data-intensive scientific fields. While persistent homology effectively identifies basic topological features such as "holes," it lacks the…
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…
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…
In this paper we summarise the work discussed in Ref. [1] and [2] (q-alg/9505003), in which we introduced a method helpful in solving the problem of knot classification. We also present results obtained since then.
To a closed braid in a solid torus we associate a trace graph in a thickened torus in such a way that closed braids are isotopic if and only if their trace graphs can be related by trihedral and tetraherdal moves. For closed braids with a…
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 use microlocal sheaf theory to show that if two knots have Legendrian isotopic conormal tori, then the knots are isotopic or mirror images.
A probabilistic approach to the stable matching problem has been identified as an important research area with several important open problems. When considering random matchings, ex-post stability is a fundamental stability concept. A…
It is a well-known procedure for constructing a torus knot or link that first we prepare an unknotted torus and meridian disks in the complementary solid tori of it, and second smooth the intersections of the boundary of meridian disks…
This review deals with the inconsistency of inner dark matter density profiles in dwarf galaxies, known as the cusp-core problem. Particularly, we aim to focus on gas-poor dwarf galaxies. One of the most promising solutions to this cold…
We describe a normal surface algorithm that decides whether a knot, with known degree of the colored Jones polynomial, satisfies the Strong Slope Conjecture. We also discuss possible simplifications of our algorithm and state related open…
Tracking in high-density environments, such as the core of TeV jets, is particularly challenging both because combinatorics quickly diverge and because tracks may not leave anymore individual "hits" but rather large clusters of merged…
The following problem is NP-hard: given a regular expression $E$, decide if $E^*$ is not co-finite.