中文
相关论文

相关论文: Hard Unknots and Collapsing Tangles

200 篇论文

We give a new geometric obstruction to the iterated Bing double of a knot being a slice link: for n>1 the (n+1)-st iterated Bing double of a knot is rationally slice if and only if the n-th iterated Bing double of the knot is rationally…

几何拓扑 · 数学 2008-07-01 Jae Choon Cha , Taehee Kim

We consider the ways in which a 4-tangle T inside a unit cube can be extended outside the cube into a knot or link L. We present two links n(T) and d(T) such that the greatest common divisor of the determinants of these two links always…

几何拓扑 · 数学 2007-05-23 David A. Krebes

We consider the question of when a rational homology 3-sphere is rational homology cobordant to a connected sum of lens spaces. We prove that every rational homology cobordism class in the subgroup generated by lens spaces is represented by…

几何拓扑 · 数学 2020-11-04 Paolo Aceto , Daniele Celoria , JungHwan Park

We prove a number of results related to the computational complexity of recognizing well-covered graphs. Let $k$ and $s$ be positive integers and let $G$ be a graph. Then $G$ is said - $\mathbf{W_k}$ if for any $k$ pairwise disjoint…

组合数学 · 数学 2024-04-12 Carl Feghali , Malory Marin , Rémi Watrigant

Let X be a (connected and reduced) complex space. A q-collar of X is a bounded domain whose boundary is a union of a strongly q-pseudoconvex, a strongly q-pseudoncave and two flat (i.e. locally zero sets of pluriharmonic functions)…

复变函数 · 数学 2008-02-04 Alberto Saracco , Giuseppe Tomassini

In Theorem 1.2 of the paper math.GT/0002110 the author claimed to have proved that all transversal knots whose topological knot type is that of an iterated torus knot (we call them cable knots) are transversally simple. That theorem is…

几何拓扑 · 数学 2007-05-23 William W. Menasco

The unknotting number is the classical invariant of a knot. However, its determination is difficult in general. To obtain the unknotting number from definition one has to investigate all possible diagrams of the knot. We tried to show the…

几何拓扑 · 数学 2013-06-25 Kang-Il Ri , Yun-Ho An , Chang-Il Rim

Trellises are crucial graphical representations of codes. While conventional trellises are well understood, the general theory of (tail-biting) trellises is still under development. Iterative decoding concretely motivates such theory. In…

信息论 · 计算机科学 2014-02-27 David Conti , Nigel Boston

We define an obstruction for a knot to be Z[Z]-homology ribbon, and use this to provide restrictions on the integers that can occur as the triple linking numbers of derivative links of knots that are either homotopy ribbon or doubly slice.…

几何拓扑 · 数学 2018-02-06 JungHwan Park , Mark Powell

We show that the problem of recognizing that a knot diagram represents a specific torus knot, or any torus knot at all, is in the complexity class ${\sf NP} \cap {\sf co\text{-}NP}$, assuming the generalized Riemann hypothesis. We also show…

几何拓扑 · 数学 2019-03-08 John A. Baldwin , Steven Sivek

We consider the problem of untangling a given (non-planar) straight-line circular drawing $\delta_G$ of an outerplanar graph $G=(V, E)$ into a planar straight-line circular drawing by shifting a minimum number of vertices to a new position…

计算几何 · 计算机科学 2021-12-21 Sujoy Bhore , Guangping Li , Martin Nöllenburg , Ignaz Rutter , Hsiang-Yun Wu

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

计算复杂性 · 计算机科学 2012-10-30 Nicolas de Rugy-Altherre

We classify Legendrian rational unknots with tight complements in the lens spaces L(p,1) up to coarse equivalence. As an example of the general case, this classification is also worked out for L(5,2). The knots are described explicitly in a…

辛几何 · 数学 2018-03-22 Hansjörg Geiges , Sinem Onaran

A natural number N is said to be palindromic if its binary representation reads the same forwards and backwards. In this paper we study the quotients of two palindromic numbers and answer some basic questions about the resulting sets of…

数论 · 数学 2022-03-01 James Haoyu Bai , Joseph Meleshko , Samin Riasat , Jeffrey Shallit

Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…

数论 · 数学 2023-11-07 Alp Bassa , Gaetan Bisson , Roger Oyono

We study the band-unknotting number $u_{nb}(K)$ of a knot $K$, and how it behaves with respect to connect sums. We show that this sub-additive function is not additive under connected sums, by finding infinitely many examples of knots $K_1,…

几何拓扑 · 数学 2025-12-09 Nakisa Ghanbarian , Stanislav Jabuka

A generating function is given for the number, $E(l,k)$, of irreducible $k$-fold Euler sums, with all possible alternations of sign, and exponents summing to $l$. Its form is remarkably simple: $\sum_n E(k+2n,k) x^n = \sum_{d|k}\mu(d)…

高能物理 - 理论 · 物理学 2008-02-03 D. J. Broadhurst

A beautiful theorem of Zeckendorf states that every positive integer has a unique decomposition as a sum of non-adjacent Fibonacci numbers. Such decompositions exist more generally, and much is known about them. First, for any positive…

We give the first examples of a pair of knots $K_1$,$K_2$ in the 3-sphere for which their unknotting numbers satisfy $u(K_1\#K_2)<u(K_1)+u(K_2)$ . This answers question 1.69(B) from Kirby's problem list, "Problems in low-dimensional…

几何拓扑 · 数学 2025-09-16 Mark Brittenham , Susan Hermiller

We prove that if an alternating knot has unknotting number one, then there exists an unknotting crossing in any alternating diagram. This is done by showing that the obstruction to unknotting number one developed by Greene in his work on…

几何拓扑 · 数学 2017-04-11 Duncan McCoy