中文
相关论文

相关论文: The concordance crosscap number and rational Witt …

200 篇论文

Depth-3 circuit lower bounds and $k$-SAT algorithms are intimately related; the state-of-the-art $\Sigma^k_3$-circuit lower bound and the $k$-SAT algorithm are based on the same combinatorial theorem. In this paper we define a problem which…

计算复杂性 · 计算机科学 2024-05-24 Mohit Gurumukhani , Ramamohan Paturi , Pavel Pudlák , Michael Saks , Navid Talebanfard

The crossing number ${\mbox {cr}}(G)$ of a graph $G=(V,E)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$-planar crossing number of $G$, ${\mbox {cr}}_k(G)$, is defined as the…

This thesis develops some general calculational techniques for finding the orders of knots in the topological concordance group C. The techniques currently available in the literature are either too theoretical, applying to only a small…

几何拓扑 · 数学 2012-06-05 Julia Collins

Using Gauss diagrams, one can define the virtual bridge number ${\rm vb}(K)$ and the welded bridge number ${\rm wb}(K),$ invariants of virtual and welded knots with ${\rm wb}(K) \leq {\rm vb}(K).$ If $K$ is a classical knot, Chernov and…

几何拓扑 · 数学 2015-04-17 Hans U. Boden , Anne Isabel Gaudreau

The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar drawing of G. The rectilinear crossing number cr'(G) of G is the minimum number of crossings in a rectilinear nondegenerate planar drawing…

We show that if a classical knot diagram satisfies a certain combinatorial condition then it is minimal with respect to the number of classical crossings. This statement is proved by using the Kauffman bracket and the construction of atoms…

几何拓扑 · 数学 2007-05-23 Vassily Olegovich Manturov

Ozsv\'ath and Szab\'o used the knot filtration on $\widehat{CF}(S^3)$ to define the $\tau$-invariant for knots in the 3-sphere. In this article, we generalize their construction and define a collection of $\tau$-invariants associated to a…

几何拓扑 · 数学 2020-07-29 Katherine Raoux

It is a very old conjecture that the crossing number of knots is additive under connected sum. In other words, if K#K' is the connected sum of knots K and K', then does the equality c(K#K') = c(K) + c(K') hold? We prove that c(K#K') is at…

几何拓扑 · 数学 2014-02-26 Marc Lackenby

Knot mosaics are used to model physical quantum states. The mosaic number of a knot is the smallest integer $m$ such that the knot can be represented as a knot $m$-mosaic. In this paper we establish an upper bound for the crossing number of…

几何拓扑 · 数学 2018-05-29 Hugh Howards , Andrew Kobin

We study three knot invariants related to smoothly immersed disks in the four-ball. These are the four-ball crossing number, which is the minimal number of normal double points of such a disk bounded by a given knot; the slicing number,…

几何拓扑 · 数学 2015-11-05 Brendan Owens , Saso Strle

The lattice stick number $s_L(K)$ of a knot $K$ is defined to be the minimal number of straight line segments required to construct a stick presentation of $K$ in the cubic lattice. In this paper, we find an upper bound on the lattice stick…

几何拓扑 · 数学 2017-05-17 KyungPyo Hong , SungJong No , SeungSang Oh

Given a fixed positive integer $k$, the $k$-planar local crossing number of a graph $G$, denoted by $\text{LCR}_k(G)$, is the minimum positive integer $L$ such that $G$ can be decomposed into $k$ subgraphs, each of which can be drawn in a…

组合数学 · 数学 2018-04-09 John Asplund , Thao do , Arran Hamm , Vishesh Jain

Milnor's $\bar{\mu}$-invariants of links in the $3$-sphere $S^3$ vanish on any link concordant to a boundary link. In particular, they are trivial on any knot in $S^3$. Here we consider knots in thickened surfaces $\Sigma \times [0,1]$,…

几何拓扑 · 数学 2022-11-02 Micah Chrisman

We define a knot to be half ribbon if it is the cross-section of a ribbon 2-knot, and observe that ribbon implies half ribbon implies slice. We introduce the half ribbon genus of a knot K, the minimum genus of a ribbon knotted surface of…

Let c(K;F) denote the surface crossing number of a knot K with respect to a closed connected surface F in S^3. We relate c(K;F) to the tunnel number t(K) and to the Heegaard deficiency delta(F)=g(M_1;F)+g(M_2;F)-g(F), where S^3=M_1 union_F…

几何拓扑 · 数学 2026-05-22 Makoto Ozawa

Given an integer $k \geq 2$, we consider the problem of computing the smallest real number $t(k)$ such that for each set $P$ of points in the plane, there exists a $t(k)$-spanner for $P$ that has chromatic number at most $k$. We prove that…

计算几何 · 计算机科学 2007-11-02 Prosenjit Bose , Paz Carmi , Mathieu Couture , Anil Maheshwari , Michiel Smid , Norbert Zeh

We give a complete description of the set of triples (a,b,c) of real numbers with the following property. There exists a constant K such that a n_3 + b n_2 + c n_1 - K is a lower bound for the matching number of every connected subcubic…

组合数学 · 数学 2016-05-17 Penny Haxell , Alex Scott

Cha and Kim proved that if a knot K is not algebraically slice, then no iterated Bing double of K is concordant to the unlink. We prove that if K has nontrivial signature $\sigma$, then the n-iterated Bing double of K is not concordant to…

几何拓扑 · 数学 2015-05-20 Charles Livingston , Cornelia Van Cott

Given a knot $K$ parametrized by $r: [0,2\pi] \to \mathbb{R}^3$, we can define the electric potential on its complement by $\Phi(x) = \int_0^{2\pi} \frac{|r'(t)|}{|x - r(t)|}dt$. Physicists and knot theorists want to understand the critical…

动力系统 · 数学 2021-04-02 Max Lipton

A weaving knot is an alternating knot whose minimal diagram is a closed braid of a lattice-like pattern. In this paper, the warping degree of a braid diagram is defined, and upper bounds of the unknotting number and the region unknotting…

几何拓扑 · 数学 2025-11-06 Ayaka Shimizu , Amrendra Gill , Sahil Joshi