Related papers: Petal diagram from simple braids

The A-polynomial of a knot is defined in terms of SL(2,C) representations of the knot group, and encodes information about essential surfaces in the knot complement. In 2005, Dunfield-Garoufalidis and Boyer-Zhang proved that it detects the…

Twisted torus links $T(p,q;r,s)$ generalize torus links by introducing $s$ additional twists on $r$ adjacent strands of the torus link $T(p,q)$. It is well known that the number of components of a torus link $T(p, q)$ is given by the…

In this paper, we give a necessary condition for a diagram to represent the trivial knot.

We present an example of a monotone two-parameter family of vector fields on a torus whose bifurcation diagram we demonstrate to be in the class of "simplest" diagrams proposed by Baesens & MacKay (2018 Nonlinearity 31 2928--81). This shows…

We compute the Chekanov-Eliashberg contact homology of what we call the Legendrian closure of a positive braid. We also construct an augmentation for each such link diagram. Then we apply the monodromy techniques established in an earlier…

A knot type is exchange reducible if an arbitrary closed n-braid representative can be changed to a closed braid of minimum braid index by a finite sequence of braid isotopies, exchange moves and +/- destabilizations. In the manuscript [J…

The Bollobas-Riordan polynomial [Math. Ann. 323, 81 (2002)] extends the Tutte polynomial and its contraction/deletion rule for ordinary graphs to ribbon graphs. Given a ribbon graph $\cG$, the related polynomial should be computable from…

We show that a $(p,q)$-cable of a non-trivial knot $K$ does not admit chirally cosmetic surgery for $q\neq 2$, or $q=2$ with additional assumptions. In particular, we show that $(p,q)$-cable of non-trivial knot $K$ does not admit chirally…

Let $K$ be a genus $g$ alternating knot with Alexander polynomial $\Delta_K(T)=\sum_{i=-g}^ga_iT^i$. We show that if $|a_g|=|a_{g-1}|$, then $K$ is the torus knot $T_{2g+1,\pm2}$. This is a special case of the Fox Trapezoidal Conjecture.…

A Chebyshev curve $\mathcal{C}(a,b,c,\phi)$ has a parametrization of the form$ x(t)=T\_a(t)$; \ $y(t)=T\_b(t)$; $z(t)= T\_c(t + \phi)$, where $a,b,c$are integers, $T\_n(t)$ is the Chebyshev polynomialof degree $n$ and $\phi \in \mathbb{R}$.…

We study Kauffman's model of folded ribbon knots: knots made of a thin strip of paper folded flat in the plane. The folded ribbonlength is the length to width ratio of such a ribbon knot. We give upper bounds on the folded ribbonlength of…

We show that most cabled knots over torus knots in $S^3$ satisfy the AJ-conjecture, namely each $(r,s)$-cabled knot over each $(p,q)$-torus knot satisfies the $AJ$-conjecture if $r$ is not a number between $0$ and $pqs$.

A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we…

For pattern knots admitting genus-one bordered Heegaard diagrams, we show the knot Floer chain complexes of the corresponding satellite knots can be computed using immersed curves. This, in particular, gives a convenient way to compute the…

We prove that if a knot $K$ has a particular type of diagram then all non-trivial surgeries on $K$ contain a coorientable taut foliation. Knots admitting such diagrams include many two-bridge knots, many pretzel knots, many Montesinos knots…

We consider a surface link in the 4-space which can be presented by a simple branched covering over the standard torus, which we call a torus-covering link. Torus-covering links include spun $T^2$-knots and turned spun $T^2$-knots. In this…

We develop an algebraic representation for (1,1)-knots using the mapping class group of the twice punctured torus MCG(T,2). We prove that every (1,1)-knot in a lens space L(p,q) can be represented by the composition of an element of a…

In this paper, we investigate the minimum number of triangles, denoted by $t(n,k)$, in $n$-vertex $k$-regular graphs, where $n$ is an odd integer and $k$ is an even integer. The well-known Andr\'asfai-Erd\H{o}s-S\'os Theorem has established…

An $r$-regular graph is an $r$-graph, if every odd set of vertices is connected to its complement by at least $r$ edges. Seymour [On multicolourings of cubic graphs, and conjectures of Fulkerson and Tutte.~\emph{Proc.~London…

The Erd\H{o}s-S\'os Conjecture states that every graph with average degree exceeding $k-1$ contains every tree with $k$ edges as a subgraph. We prove that there are $\delta>0$ and $k_0\in\mathbb N$ such that the conjecture holds for every…