Related papers: Petal diagram from simple braids

A torus-covering $T^2$-knot is a surface-knot of genus one determined from a pair of commutative braids. For a torus-covering $T^2$-knot $F$, we determine the number of irreducible metabelian $SU(2)$-representations of the knot group of $F$…

We compose the table of knots in the thickened torus T x I having diagrams with at most 4 crossings. The knots are constructed by the three-step process. First we list regular graphs of degree 4 with at most 4 vertices, then for each graph…

Gy\'arf\'as and Sumner independently conjectured that for every tree $T$, the class of graphs not containing $T$ as an induced subgraph is $\chi$-bounded, that is, the chromatic numbers of graphs in this class are bounded above by a…

In this article we take up the calculation of the minimum number of colors needed to produce a non-trivial coloring of a knot. This is a knot invariant and we use the torus knots of type (2, n) as our case study. We calculate the minima in…

Let $D(p,q)$ be the usual knot diagram of the $(p,q)$-torus knot, that is, $D(p,q)$ is the closure of the $p$-braid $(\sigma_1^{-1} \sigma_2^{-1}... \sigma_{p-1}^{-1})^q$. As is well-known, $D(p,q)$ and $D(q,p)$ represent the same knot. It…

We prove that the N-colored Jones polynomial for the torus knot T_{s,t} satisfies the second order difference equation, which reduces to the first order difference equation for a case of T_{2,2m+1}. We show that the A-polynomial of the…

Let $\beta:=\sigma_1\sigma_2^{-1}$ be a braid in $B_3$, where $B_3$ is the braid group on 3 strings and $\sigma_1, \sigma_2$ are the standard Artin generators. We use Gauss diagram formulas to show that for each natural number $n$ not…

We introduce a new way to tabulate knots by representing knot diagrams using a pair of planar trees. This pair of trees have their edges labeled by integers, they have no valence 2 vertices, and they have the same number of valence 1…

New explicit procedures for passing among triplane diagrams, braid movies, and braid charts for knotted surfaces in $\mathbb{R}^4$ are presented. To this end, rainbow diagrams, which lie between braid charts and triplanes, are introduced.…

In this paper we will associate a family $\{K_1,\dots,K_l\}\subset \mathbb{S}^3$ of iterated torus knots to a given free numerical semigroup. We will describe the fundamental group of the knot complement of each knot of the family. Finally,…

We show that for each even integer $m\ge 2$, every reduced shadow with sufficiently many crossings is a shadow of a torus knot T(2,m+1), or of a twist knot $T_m$, or of a connected sum of $m$ trefoil knots.

Several distinct Garside monoids having torus knot groups as groups of fractions are known. For $n,m\geq 2$ two coprime integers, we introduce a new Garside monoid $\mathcal{M}(n,m)$ having as Garside group the $(n,m)$-torus knot group,…

Katona and Varga showed that for any rational number $t \in (1/2,1]$, no chordal graph is minimally $t$-tough, while Katona and Khan characterized all minimally $t$-tough, chordal graphs with $t \le 1/2$. We conjecture that no chordal graph…

We construct a map from knots to (abstract) 2-knots which can be extended to higher dimensions; this map is the natural "knot" counterpart for "braid" theory of groups $G_{n}^{k}$.

We ask the question, which oriented trees $T$ must be contained as subgraphs in every finite directed graph of sufficiently large minimum out-degree. We formulate the following simple condition: all vertices in $T$ of in-degree at least $2$…

We show that the graph of a simplicial polytope of dimension $d \ge 3$ has no nontrivial minimum edge cut with fewer than $d(d+1)/2$ edges, hence the graph is $\min\{\delta, d(d+1)/2\}$-edge-connected where $\delta$ denotes the minimum…

Using Kauffman's model of flat knotted ribbons, we demonstrate how all regular polygons of at least seven sides can be realised by ribbon constructions of torus knots. We calculate length to width ratios for these constructions thereby…

Menger's theorem tells us that if $S,T$ are sets of vertices in a graph $G$, then (for $k\ge0$) either there are $k+1$ vertex-disjoint paths between $S$ and $T$, or there is a set of $k$ vertices separating $S$ and $T$. But what if we want…

Let $f(n,r,k)$ be the minimal number such that every hypergraph larger than $f(n,r,k)$ contained in $\binom{[n]}{r}$ contains a matching of size $k$, and let $g(n,r,k)$ be the minimal number such that every hypergraph larger than $g(n,r,k)$…

Given a band sum of a split two-component link along a nontrivial band, we obtain a family of knots indexed by the integers by adding any number of full twists to the band. We show that the knots in this family have the same Heegaard knot…