中文
相关论文

相关论文: The Computational Complexity of Knot and Link Prob…

200 篇论文

We show that the equivariant and non-equivariant non-orientable 4-genus of p-periodic knots may differ, for any choice of p>1. Similar results have previously been obtained for the smooth 4-genus and non-orientable 3-genus of a periodic…

几何拓扑 · 数学 2021-07-02 Taran Grove , Stanislav Jabuka

The paper introduces Slope Conjecture which relates the degree of the Jones polynomial of a knot and its parallels with the slopes of incompressible surfaces in the knot complement. More precisely, we introduce two knot invariants, the…

几何拓扑 · 数学 2010-05-26 Stavros Garoufalidis

We consider the space of all smooth knots in the 3-sphere isotopic to a given knot, with the aim of finding a small subspace onto which this large space deformation retracts. For torus knots and many hyperbolic knots we show the subspace…

几何拓扑 · 数学 2007-05-23 Allen Hatcher

The Orbit Problem consists of determining, given a matrix $A\in \mathbb{R}^{d\times d}$ and vectors $x,y\in \mathbb{R}^d$, whether there exists $n\in \mathbb{N}$ such that $A^n=y$. This problem was shown to be decidable in a seminal work of…

计算复杂性 · 计算机科学 2016-11-07 Shaull Almagor , Joël Ouaknine , James Worrell

Given a knot in a closed connected orientable 3-manifold we prove that if the exterior of the knot admits an aperiodic contact form that is Euclidean near the boundary, then the 3-manifold is diffeomorphic to the 3-sphere and the knot is…

辛几何 · 数学 2026-02-10 Marc Kegel , Jay Schneider , Kai Zehmisch

We survey the problem of deciding the stability or stabilizability of uncertain linear systems whose region of uncertainty is a polytope. This natural setting has applications in many fields of applied science, from Control Theory to…

系统与控制 · 计算机科学 2014-02-12 Nikos Vlassis , Raphaël Jungers

Deciding whether a diagram of a knot can be untangled with a given number of moves (as a part of the input) is known to be NP-complete. In this paper we determine the parameterized complexity of this problem with respect to a natural…

计算复杂性 · 计算机科学 2021-11-10 Clément Legrand-Duchesne , Ashutosh Rai , Martin Tancer

For a knot $K$ in the 3-sphere and a simply connected closed 4-manifold $X$, we define the $X$-double slice genus of $K$, extending the notion from the case when $X$ is the 4-sphere. We show that for each integer $n$, there exists an…

几何拓扑 · 数学 2026-02-05 Se-Goo Kim , Taehee Kim

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…

In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Since a topological equivalence of knots can…

形式语言与自动机理论 · 计算机科学 2009-07-27 Vitaliy Kurlin , Alexei Lisitsa , Igor Potapov , Rafiq Saleh

Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two problems related to circular separability. A linear-time…

计算几何 · 计算机科学 2016-08-31 Jean-Daniel Boissonnat , Jurek Czyzowicz , Olivier Devillers , Mariette Yvinec

We resolve three long-standing open problems, namely the (algorithmic) decidability of network coding, the decidability of conditional information inequalities, and the decidability of conditional independence implication among random…

信息论 · 计算机科学 2023-08-29 Cheuk Ting Li

It is known that for every knotted curve in space, there is a line intersecting it in four places, a quadrisecant. Comparing the order of the four points along the line and knot we can distinguish three types of quadrisecants; the…

几何拓扑 · 数学 2007-05-23 E. Denne

We prove that any knot or link in any 3-manifold can be nicely decomposed (splitted) by a filling Dehn sphere. This has interesting consequences in the study of branched coverings over knots and links. We give an algorithm for computing…

几何拓扑 · 数学 2015-09-04 Álvaro Lozano Rojo , Rubén Vigara Benito

Given a (genus 2) cube-with-holes M, i.e. the complement in S^3 of a handlebody H, we relate intrinsic properties of M (like its cut number) with extrinsic features depending on the way the handlebody H is knotted in S^3. Starting from a…

几何拓扑 · 数学 2015-03-17 Riccardo Benedetti , Roberto Frigerio

Knots are fascinating topological structures that have been observed in various contexts, ranging from micro-worlds to macro-systems, and are conjectured to play a fundamental role in their respective fields. In order to characterize their…

生物物理 · 物理学 2021-10-27 Tian Chen , Xingen Zheng , Qingsong Pei , Deyuan Zou , Houjun Sun , Xiangdong Zhang

A polynomial is presented that models a topological knot in a unique manner. It distinguishes all types of knots including the orientation and has a group theory interpretation. The topologies may be labeled via a number, which upon a base…

综合物理 · 物理学 2007-05-23 Gordon Chalmers

Many structures in science, engineering, and art can be viewed as curves in 3-space. The entanglement of these curves plays a crucial role in determining the functionality and physical properties of materials. Many concepts in knot theory…

几何拓扑 · 数学 2024-11-27 Ruzhi Song , Fengling Li , Jie Wu , Fengchun Lei , Guo-Wei Wei

Let $S=\{K_{1,3},K_3,P_4\}$ be the set of connected graphs of size 3. We study the problem of partitioning the edge set of a graph $G$ into graphs taken from any non-empty $S'\subseteq S$. The problem is known to be NP-complete for any…

数据结构与算法 · 计算机科学 2022-08-29 Laurent Bulteau , Guillaume Fertin , Anthony Labarre , Romeo Rizzi , Irena Rusu

We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension $d$: i) Given $n$ points in $\Rd$, compute their minimum enclosing cylinder. ii) Given two $n$-point sets in $\Rd$, decide…

计算几何 · 计算机科学 2015-02-18 Panos Giannopoulos , Christian Knauer , Gunter Rote , Daniel Werner