相关论文: Segment number of knots

We define a coalgebra structure for open strings transverse to any framed codimension 2 submanifold. When the submanifold is a knot in R^3, we show this structure recovers a specialization of the Ng cord algebra, a non-trivial knot…

We prove that the graphs $T\boxslash P$ have unbounded stack number and queue number $3$, where $T$ is a tree and $P$ is a path, and $\boxslash$ denotes the graph strong product but with one of the directions removed. The previous best…

A petal projection of a knot $K$ is a projection of a knot which consists of a single multi-crossing and non-nested loops. Since a petal projection gives a sequence of natural numbers for a given knot, the petal projection is a useful model…

Neuwirth asked if any non-trivial knot in the 3-sphere can be embedded in a closed surface so that the complement of the surface is a connected essential surface for the knot complement. In this paper, we examine some variations on this…

The slope number of a graph $G$ is the smallest number of slopes needed for the segments representing the edges in any straight-line drawing of $G$. It serves as a measure of the visual complexity of a graph drawing. Several bounds on the…

The lectures review the state of affairs in modern branch of mathematical physics called probabilistic topology. In particular we consider the following problems: (i) We estimate the probability of a trivial knot formation on the lattice…

The doubly slice genus of a knot in the 3-sphere is the minimal genus among unknotted orientable surfaces in the 4-sphere for which the knot arises as a cross-section. We use the classical signature function of the knot to give a new lower…

We compute lower bounds on the virtual crossing number and minimal surface genus of virtual knot diagrams from the arrow polynomial. In particular, we focus on several interesting examples.

A directed graph $G$ is $\textit{intrinsically linked}$ if every embedding of that graph contains a non-split link $L$, where each component of $L$ is a consistently oriented cycle in $G$. A $\textit{tournament}$ is a directed graph where…

A knot is an an embedding of a circle into three-dimensional space. We say that a knot is unknotted if there is an ambient isotopy of the embedding to a standard circle. By representing knots via planar diagrams, we discuss the problem of…

We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…

A vertex whose removal in a graph $G$ increases the number of components of $G$ is called a cut vertex. For all $n,c$, we determine the maximum number of connected induced subgraphs in a connected graph with order $n$ and $c$ cut vertices,…

Suppose $K$ is a knot in a closed 3-manifold $M$ such that $\bar{M-N(K)}$ is irreducible. We show that for any positive integer $b$ there exists a triangulation of $\bar{M-N(K)}$ such that any weakly incompressible bridge surface for $K$ of…

We show that if $K$ is a knot in $S^3$ and $\Sigma$ is a bridge sphere for $K$ with high distance and $2n$ punctures, the number of perturbations of $K$ required to interchange the two balls bounded by $\Sigma$ via an isotopy is $n$. We…

An inscribed knot is formed by polygonally connecting points lying on a knot $\gamma$ in parametric order, then closing the path by connecting the first and final points. The stick-knot number of a knot type K is the minimum number of line…

A knotted ribbon is one of physical aspect of a knot. A folded ribbon knot is a depiction of a knot obtained by folding a long and thin rectangular strip to become flat. The ribbonlength of a knot type can be defined as the minimum length…

We present a practical algorithm to determine the minimal genus of non-orientable spanning surfaces for 2-bridge knots, called the crosscap numbers. We will exhibit a table of crosscap numbers of 2-bridge knots up to 12crossings (all 362 of…

Every classical or virtual knot is equivalent to the unknot via a sequence of extended Reidemeister moves and the so-called forbidden moves. The minimum number of forbidden moves necessary to unknot a given knot is an invariant we call the…

Let $M$ be a connected, closed, oriented three-manifold and $K$, $L$ two rationally null-homologous oriented simple closed curves in $M$. We give an explicit algorithm for computing the linking number between $K$ and $L$ in terms of a…

The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway…