Related papers: On the bridge number of knot diagrams with minimal…
Let M be $S^3$, $S^1\times S^2$, or a lens space L(p,q), and let k be a (1,1)-knot in M, i.e., a knot which is of 1-bridge with respect to a Heegaard torus. We show that if there is a closed meridionally incompressible surface in the…
A graph is $1$-planar, if it can be drawn in the plane such that there is at most one crossing on every edge. It is known, that $1$-planar graphs have at most $4n-8$ edges. We prove the following odd-even generalization. If a graph can be…
In this paper we study welded knots and their invariants. We focus on generating examples of non-trivial knotted ribbon tori as the tube of welded knots that are obtained from classical knot diagrams by welding some of the crossings.…
The study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing. One of the most studied types of drawings in this area are the…
We prove that if $G$ is a graph with an minimal edge cut $F$ of size three and $G_1$, $G_2$ are the two (augmented) components of $G-F$, then the crossing number of $G$ is equal to the sum of crossing numbers of $G_1$ and $G_2$. Combining…
For every connected graph $G$ and surface $S$, we consider the well-known string of inequalities $\delta_S(G) \leq \mu_S(G) \leq \nu_S(G)$, where $\mu$ and $\nu$ denote skewness and crossing number and $\delta$ is the Euler-formula lower…
In Theorem 1.2 of the paper math.GT/0002110 the author claimed to have proved that all transversal knots whose topological knot type is that of an iterated torus knot (we call them cable knots) are transversally simple. That theorem is…
We compute the genus zero bridge numbers and give lower bounds on the genus one bridge numbers for a large class of sufficiently generic hyperbolic twisted torus knots. As a result, the bridge spectra of these knots have two gaps which can…
Knots have been considered to be useful models for simulating molecular chains such as DNA and proteins. One quantity that we are interested on molecular knots is the minimum number of monomers necessary to realize a knot. In this paper we…
The crossing number of a graph is the minimum number of crossings over all of its drawings on the plane. The Crossing Lemma, proved more than 40 years ago, is a tight lower bound on the crossing number of a graph in terms of the number of…
In this paper, we give a necessary condition for a diagram to represent the trivial knot.
In this paper, we determine the average genus of all the $2$-bridge knots with a given crossing number. As a consequence, we obtain the oblique asymptote of this value as the crossing number grows.
Beyond planarity concepts (prominent examples include k-planarity or fan-planarity) apply certain restrictions on the allowed patterns of crossings in drawings. It is natural to ask, how much the number of crossings may increase over the…
We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…
A diagonal surface in a link exterior M is a properly embedded, incompressible, boundary incompressible surface which furthermore has the same number of boundary components and same slope on each component of the boundary of M. We derive a…
For a knot K in S^3, let T(K) be the characteristic toric sub-orbifold of the orbifold (S^3,K) as defined by Bonahon and Siebenmann. If K has unknotting number one, we show that an unknotting arc for K can always be found which is disjoint…
The {\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. Motivated by the recent work [Faria, L., Figueiredo, C.M.H. de, Sykora, O., Vrt'o, I.: An improved upper bound on the…
Let $K$ be a knot with an unknotting tunnel $\gamma$ and suppose that $K$ is not a 2-bridge knot. There is an invariant $\rho = p/q \in \mathbb{Q}/2 \mathbb{Z}$, $p$ odd, defined for the pair $(K, \gamma)$. The invariant $\rho$ has…
Ascending numbers are determined for 64 knots with at most n=10 crossings. After proving the theorem about the signature of alternating knot families, we distinguished all families of knots obtained from generating alternating knots with at…
Using Boolean algebra, we discuss the region unknotting number of a knot, and show that the region unknotting number is less than or equal to (c+1)/2 for any knot with crossing number c. This is a progress from (c+2)/2.