Related papers: Petal diagram from simple braids

Every knot has a plat projection, obtained by closing up a braid with bridges. The plat projection is determined by the number of strands and the number of rows of twist regions in the braid, and an integer number of crossings in each twist…

The famous Erd\H{o}s-S\'os conjecture states that every graph of average degree more than $t-1$ must contain every tree on $t+1$ vertices. In this paper, we study a spectral version of this conjecture. For $n>k$, let $S_{n,k}$ be the join…

We apply knot Floer homology to exhibit an infinite family of transversely nonsimple prime knots starting with $10_{132}$. We also discuss the combinatorial relationship between grid diagrams, braids, and Legendrian and transverse knots in…

In 2003, Hikami and Kirillov uncovered an intriguing connection between torus knots $\mathcal{K}_{(P,Q)}$ and Virasoro minimal models $\mathcal{M}(P,Q)$ by relating the Kashaev invariants of the knots to the characters of the corresponding…

We show that a torus knot which is not 2-bridge has a unique irreducible bridge splitting of positive genus.

The theory of tunnel number 1 knots detailed in our previous paper, The tree of knot tunnels, provides a non-negative integer invariant called the depth of the tunnel. We give various results related to the depth invariant. Noting that it…

It has been conjectured that the algebraic crossing number of a link is uniquely determined in minimal braid representation. This conjecture is true for many classes of knots and links. The Morton-Franks-Williams inequality gives a lower…

We give explicit deformations of embeddings of abstractly planar graphs that lie on the standard torus $T^2 \subset \mathbb{R}^3$ and that contain neither a nontrivial knot nor a nonsplit link into the plane. It follows that ravels do not…

Kriesel conjectured that every minimally $1$-tough graph has a vertex with degree precisely $2$. Katona and Varga (2018) proposed a generalized version of this conjecture which says that every minimally $t$-tough graph has a vertex with…

In this paper, we show the trivializing number of all minimal diagrams of positive 2-bridge knots and study the relation between the trivializing number and the unknotting number for a part of these knots.

A 1-bridge torus knot in a 3-manifold of genus $\le 1$ is a knot drawn on a Heegaard torus with one bridge. We give two types of normal forms to parameterize the family of 1-bridge torus knots that are similar to the Schubert's normal form…

Knots are commonly represented and manipulated via diagrams, which are decorated planar graphs. When such a knot diagram has low treewidth, parameterized graph algorithms can be leveraged to ensure the fast computation of many invariants…

We calculate the alternating number of torus knots with braid index 4 and less. For the lower bound, we use the upsilon-invariant recently introduced by Ozsv\'ath, Stipsicz, and Szab\'o. For the upper bound, we use a known bound for braid…

We prove that for every bipartite graph $H$ and positive integer $s$, the class of $K_{s,s}$-subgraph-free graphs excluding $H$ as a pivot-minor has bounded average degree. Our proof relies on the announced binary matroid structure theorem…

Given knots K and J, one can ask whether a single smoothing of a crossing in a diagram for K can convert it into a diagram for J. As an interesting example, Zekovic discovered that the torus knot T(2,5) can be converted into T(2,-5) with a…

For every odd integer $N$ we give an explicit construction of a polynomial curve $\cC(t) = (x(t), y (t))$, where $\deg x = 3$, $\deg y = N + 1 + 2\pent N4$ that has exactly $N$ crossing points $\cC(t_i)= \cC(s_i)$ whose parameters satisfy…

In this work we demonstrate that the q-numbers and their two-parameter generalization, the q,p-numbers, can be used to obtain some polynomial invariants for torus knots and links. First, we show that the q-numbers, which are closely…

We show that nontrivial classical pretzel knots L(p,q,r) are hyperbolic with eight exceptions which are torus knots. We find Conway polynomials of n-pretzel links using a new computation tree. As applications, we compute the genera of…

We describe the structure of 2-connected non-planar toroidal graphs with no K_{3,3}-subdivisions, using an appropriate substitution of planar networks into the edges of certain graphs called toroidal cores. The structural result is based on…

Torus knots are an important family of knots about which much is understood; invariants of torus knots often exhibit nice formulas, making them convenient and fundamental building blocks for examples in knot theory. Spiral knots, defined…