中文
相关论文

相关论文: The bridge number of surface links and kei colorin…

200 篇论文

We define the concordance crosscap number of a knot as the minimum crosscap number among all the knots concordant to the knot. The four-dimensional crosscap number is the minimum first Betti number of non-orientable surfaces smoothly…

几何拓扑 · 数学 2007-05-23 Gengyu Zhang

We show that the triple-crossing number of any knot is greater or equal to twice its (canonical) genus and we show an even stronger bound in the case of links. As an application we show that this bound is strong enough to obtain the…

几何拓扑 · 数学 2020-11-10 Michal Jablonowski

We investigate great circle links in the three-sphere, the class of links where each component is a great circle. Using the geometry of their complements, we classify such links up to five components. For any two-bridge knot complement,…

几何拓扑 · 数学 2007-05-23 Genevieve Walsh

Any 2-bridge knot in the 3-sphere has a bridge sphere from which any other bridge surface can be obtained by stabilization, meridional stabilization, perturbation and proper isotopy.

几何拓扑 · 数学 2007-05-23 Martin Scharlemann , Maggy Tomova

Previous work used polygonal realizations of knots to reduce the problem of computing the superbridge number of a realization to a linear programming problem, leading to new sharp upper bounds on the superbridge index of a number of knots.…

几何拓扑 · 数学 2022-11-14 Clayton Shonkwiler

A partial order on prime knots can be defined by declaring $J\ge K$ if there exists an epimorphism from the knot group of $J$ onto the knot group of $K$. Suppose that $J$ is a 2-bridge knot that is strictly greater than $m$ distinct,…

几何拓扑 · 数学 2018-10-12 Jim Hoste , Joshua Ocana Mercado , Patrick D. Shanahan

If a graph is in bridge position in a 3-manifold so that the graph complement is irreducible and boundary irreducible, we generalize a result of Bachman and Schleimer to prove that the complexity of a surface properly embedded in the…

几何拓扑 · 数学 2018-07-25 Marion Campisi , Matt Rathbun

It is natural to ask how many isotopy classes of embedded essential surfaces lie in a given 3-manifold. The first bounds on the number of such surfaces were exponential, using normal surfaces. More recently, by restricting to alternating…

几何拓扑 · 数学 2025-10-16 Jessica S. Purcell , Anastasiia Tsvietkova

This paper investigates the relationship between the signature and the crossing number of knots and links. We refine existing theorems and provide a comprehensive classification of links with specific properties, particularly those with…

几何拓扑 · 数学 2024-10-02 Kai Ishihara , Kei Okada , Koya Shimokawa

The Petersen colouring conjecture states that every bridgeless cubic graph admits an edge-colouring with $5$ colours such that for every edge $e$, the set of colours assigned to the edges adjacent to $e$ has cardinality either $2$ or $4$,…

组合数学 · 数学 2020-09-11 François Pirot , Jean-Sébastien Sereni , Riste Škrekovski

Given integers g_i > 1 (i=1,...,n) we prove that there exist infinitely may knots K_i in S^3 so that g(E(K_i)) = g_i and the Heegaard genus of the exterior of the connected sum of K_1,...,K_n is the sum the Heegaard genera of K_1,...,K_n,…

几何拓扑 · 数学 2007-05-23 Tsuyoshi Kobayashi , Yo'av Rieck

A kei, or 2-quandle, is an algebraic structure one can use to produce a numerical invariant of links, known as coloring invariants. Motivated by Mazur's analogy between prime numbers and knots, we define for every finite kei $\mathcal{K}$…

数论 · 数学 2024-08-14 Ariel Davis , Tomer M Schlank

We study smooth isotopy classes of complex curves in complex surfaces from the perspective of the theory of bridge trisections, with a special focus on curves in $\mathbb{CP}^2$ and $\mathbb{CP}^1\times\mathbb{CP}^1$. We are especially…

几何拓扑 · 数学 2022-10-19 Peter Lambert-Cole , Jeffrey Meier

In this paper, we show that there is no surface-knot of genus one with triple point number invariant equal to three.

代数拓扑 · 数学 2018-10-23 Amal Al Kharusi , Tsukasa Yashiro

Kakimizu complexes have been found for several classes of links. O.Kakimizu found the Kakimizu complexes of knots with crossing number less than or equal to 10. Hatcher and Thurston found the 0-skeleton of the Kakimizu complex of 2-bridge…

几何拓扑 · 数学 2023-12-04 Neetal Neel

The Joint Crossing Number problem asks for a simultaneous embedding of two disjoint graphs into one surface such that the number of edge crossings (between the two graphs) is minimized. It was introduced by Negami in 2001 in connection with…

离散数学 · 计算机科学 2015-09-08 Petr Hliněný , Gelasio Salazar

A graph on $n \ge 3$ vertices drawn in the plane such that each edge is crossed at most four times has at most $6(n-2)$ edges -- this result proven by Ackerman is outstanding in the literature of beyond-planar graphs with regard to its…

组合数学 · 数学 2025-10-03 Aaron Büngener

Given a diagram $D$ of a knot $K$, we consider the number $c(D)$ of crossings and the number $b(D)$ of overpasses of $D$. We show that, if $D$ is a diagram of a nontrivial knot $K$ whose number $c(D)$ of crossings is minimal, then…

几何拓扑 · 数学 2009-11-10 Jae-Wook Chung , Xiao-Song Lin

We study the degree of polynomial representations of knots. We give the lexicographic degree of all two-bridge knots with 11 or fewer crossings. First, we estimate the total degree of a lexicographic parametrisation of such a knot. This…

几何拓扑 · 数学 2018-09-14 Erwan Brugallé , Pierre-Vincent Koseleff , Daniel Pecker

We consider diagrams of links in $S^2$ obtained by projection from $S^3$ with the Hopf map and the minimal crossing number for such diagrams. Knots admitting diagrams with at most one crossing are classified. Some properties of these knots…

几何拓扑 · 数学 2020-06-25 Maciej Mroczkowski