相关论文: Segment number of knots

We present a topological interpretation of knot and braid contact homology in degree zero, in terms of cords and skein relations. This interpretation allows us to extend the knot invariant to embedded graphs and higher-dimensional knots. We…

A knot in the 3-sphere in genus-1 1-bridge position (called a (1,1)-position) can be described by an element of the braid group of two points in the torus. Our main results tell how to translate between a braid group element and the…

A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…

We study knots in $\mathbb{S}^3$ obtained by the intersection of a minimal surface in $\mathbb{R}^4$ with a small 3-sphere centered at a branch point. We construct examples of new minimal knots. In particular we show the existence of…

We explore under what conditions one can obtain a nontrivial knot, given a collection of $n$ vectors. First, we show how to get a crossing from any 3 vectors equal in magnitude, by arbitrarily picking 2 vectors and identifying the…

Minimum braids are a complete invariant of knots and links. This paper defines minimum braids, describes how they can be generated, presents tables for knots up to ten crossings and oriented links up to nine crossings, and uses minimum…

The scramble number of a graph is an invariant recently developed to aid in the study of divisorial gonality. In this paper we prove that scramble number is NP-hard to compute, also providing a proof that computing gonality is NP-hard even…

An $n$-crossing is a point in the projection of a knot where $n$ strands cross so that each strand bisects the crossing. An \"ubercrossing projection has a single $n$-crossing and a petal projection has a single $n$-crossing such that there…

This paper is expository and is accessible to students. We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible…

A directed graph is semi-transitive if and only if it is acyclic and for any directed path $u_1\rightarrow u_2\rightarrow \cdots \rightarrow u_t$, $t \geq 2$, either there is no edge from $u_1$ to $u_t$ or all edges $u_i\rightarrow u_j$…

This paper defines a new invariant of virtual knots and links that we call the extended bracket polynomial, and denote by <<K>> for a virtual knot or link K. This invariant is a state summation over bracket states of the oriented diagram…

We introduce bridge trisections of knotted surfaces in the four-sphere. This description is inspired by the work of Gay and Kirby on trisections of four-manifolds and extends the classical concept of bridge splittings of links in the…

We will strengthen the known upper and lower bounds on the delta-crossing number of knots in therms of the triple-crossing number. The latter bound turns out to be strong enough to obtain (unknown values of) triple-crossing numbers for a…

For a genus-1 1-bridge knot in the 3-sphere, that is, a (1,1)-knot, a middle tunnel is a tunnel that is not an upper or lower tunnel for some (1,1)-position. Most torus knots have a middle tunnel, and non-torus-knot examples were obtained…

This is the third of three papers that refine and extend portions of our earlier preprint, "The depth of a knot tunnel." Together, they rework the entire preprint. In this paper, we use the theory of tunnel number 1 knots that we introduced…

The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph $G$ that does not contain a fixed graph as a minor has crossing number $O(\Delta n)$, where $G$…

A fundamental theorem in graph theory states that any 3-connected graph contains a subdivision of $K_4$. As a generalization, we ask for the minimum number of $K_4$-subdivisions that are contained in every $3$-connected graph on $n$…

A triple crossing is a crossing in a projection of a knot or link that has three strands of the knot passing straight through it. A triple crossing projection is a projection such that all of the crossings are triple crossings. We prove…

Given a straight-line drawing of a graph, a segment is a maximal set of edges that form a line segment. Given a planar graph $G$, the segment number of $G$ is the minimum number of segments that can be achieved by any planar straight-line…

Symmetries of knots have been studied extensively, and strongly invertible knots are one of them. Lamm defined the equivariant crossing number $c_t(K)$, the minimum crossing number among all symmetric diagrams for a strongly invertible knot…