中文
相关论文

相关论文: Hard Unknots and Collapsing Tangles

200 篇论文

Given a diagram D of a knot K, we give easily computable bounds for Rasmussen's concordance invariant s(K). The bounds are not independent of the diagram D chosen, but we show that for diagrams satisfying a given condition the bounds are…

几何拓扑 · 数学 2012-12-12 Andrew Lobb

A \emph{binary tanglegram} is a drawing of a pair of rooted binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example, in phylogenetics, it is essential…

Scheinerman and Wilf (1994) assert that `an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph K_n.' A rectilinear drawing of K_n is an arrangement of n vertices in…

离散数学 · 计算机科学 2011-10-04 Alex Brodsky , Stephane Durocher , Ellen Gethner

We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted…

计算复杂性 · 计算机科学 2011-08-09 Michael Kowalczyk , Jin-Yi Cai

We define a new kind of Gauss diagrams to describe knots in the solid torus with projections in the annulus. We see that it provides an efficient tool for showing that a knot diagram can be fully recovered from its decorated Gauss diagram,…

几何拓扑 · 数学 2012-01-30 Arnaud Mortier

Tandem duplication is the process of inserting a copy of a segment of DNA adjacent to the original position. Motivated by applications that store data in living organisms, Jain et al. (2017) proposed the study of codes that correct tandem…

信息论 · 计算机科学 2018-01-09 Yeow Meng Chee , Johan Chrisnata , Han Mao Kiah , Tuan Thanh Nguyen

Networks are frequently studied algebraically through matrices. In this work, we show that networks may be studied in a more abstract level using results from the theory of matroids by establishing connections to networks by decomposition…

组合数学 · 数学 2015-11-17 Konstantinos Papalamprou , Leonidas Pitsoulis

Given a group endowed with a Z/2-valued morphism we associate a Gauss diagram theory, and show that for a particular choice of the group these diagrams encode faithfully virtual knots on a given arbitrary surface. This theory contains all…

几何拓扑 · 数学 2014-03-17 Arnaud Mortier

We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…

逻辑 · 数学 2015-12-15 Justin Brody

Correlation matrices (positive semidefinite matrices with ones on the diagonal) are of fundamental interest in quantum information theory. In this work we introduce and study the set of $r$-decomposable correlation matrices: those that can…

量子物理 · 物理学 2020-12-01 Benjamin Lovitz

Distribution networks with periodically repeating events often hold great promise to exploit economies of scale. Joint replenishment problems are a fundamental model in inventory management, manufacturing, and logistics that capture these…

计算复杂性 · 计算机科学 2020-07-20 Andreas S. Schulz , Claudio Telha

A new type of knot energy is presented via real life experiments involving a thin resilient metallic tube. Knotted in different ways, the device mechanically acquires a uniquely determined (up to isometry) normal form at least when the…

几何拓扑 · 数学 2015-05-20 A. B. Sossinsky

We extend the tangle model, originally developed by Ernst and Sumners, to include composite knots. We show that, for any prime tangle, there are no rational tangle attachments of distance greater than one that first yield a 4-plat and then…

几何拓扑 · 数学 2010-07-07 Dorothy Buck , Mauro Maximo Mauricio

In Two-Sets Cut-Uncut, we are given an undirected graph $G=(V,E)$ and two terminal sets $S$ and $T$. The task is to find a minimum cut $C$ in $G$ (if there is any) separating $S$ from $T$ under the following ``uncut'' condition. In the…

数据结构与算法 · 计算机科学 2024-08-27 Matthias Bentert , Fedor V. Fomin , Fanny Hauser , Saket Saurabh

This chapter studies the problem of decomposing a tensor into a sum of constituent rank one tensors. While tensor decompositions are very useful in designing learning algorithms and data analysis, they are NP-hard in the worst-case. We will…

数据结构与算法 · 计算机科学 2020-07-31 Aravindan Vijayaraghavan

Let $u(K)$ and $g(K)$ denote the unknotting number and the genus of a knot $K$, respectively. For a 3-braid knot $K$, we show that $u(K)\le g(K)$ holds, and that if $u(K)=g(K)$ then $K$ is either a 2-braid knot, a connected sum of two…

几何拓扑 · 数学 2014-01-28 Eon-Kyung Lee , Sang-Jin Lee

We use the Blanchfield form to obtain a lower bound on the equivariant slice genus of a strongly invertible knot. For our main application, let $K$ be a genus one strongly invertible slice knot with nontrivial Alexander polynomial. We show…

几何拓扑 · 数学 2022-08-25 Allison N. Miller , Mark Powell

For each rational homology 3-sphere $Y$ which bounds simply connected definite 4-manifolds of both signs, we construct an infinite family of irreducible rational homology 3-spheres which are homology cobordant to $Y$ but cannot bound any…

几何拓扑 · 数学 2020-04-29 Kouki Sato , Masaki Taniguchi

Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram…

几何拓扑 · 数学 2014-02-26 Tatsuya Tsukamoto

In this work we attempt to generalize our result in [6] [7] for real rings (not just von Neumann regular real rings). In other words we attempt to characterize and construct real closure * of commutative unitary rings that are real. We also…

环与代数 · 数学 2009-12-07 Jose Capco