arXiv research

Functor decomposes Khovanov spectra for non-alternating diagrams.

In this paper, we show that a link which has a positive and almost alternating diagram is alternating, besides that a positive and non-alternating Montesinos link has an almost positive-alternating diagram.

Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram representing the trivial knot. As a corollary we determine an unknotting number one alter…

This paper determines the braid indices for non-alternating pretzel links.

A link is almost alternating if it is non-alternating and has a diagram that can be transformed into an alternating diagram via one crossing change. We give formulas for the first two and last two potential coefficients of the Jones polynomial of an almost alternating link. Using these formulas, we show that the Jones …

Minimal grid diagrams for 15,735 knots with 14 crossings and arc index 14.

Optimized concentric helices minimize the ropelength of non-alternating torus knots.

Study non-orientable 4-genus for 11-crossing non-alternating knots.

We investigate the behaviour of Rasmussen's invariant $s$ under the sharp operation on knots and obtain a lower bound for the sharp unknotting number. This bound leads us to an interesting move that transforms arbitrary knots into non-alternating knots.

Paper explores conditions for constructing new quasi-alternating links.

Chirality affects the curvature of molecular networks, influencing their shape and stability.

Matrix Factorization is a popular non-convex optimization problem, for which alternating minimization schemes are mostly used. They usually suffer from the major drawback that the solution is biased towards one of the optimization variables. A remedy is non-alternating schemes. However, due to a lack of Lipschitz conti…

Improved linear upper bound for ribbonlength of knots.

We show that one can interweave an unknot into any non-alternating connected projection of a link so that the resulting augmented projection is alternating.

Every knot can be embedded in the union of finitely many half planes with a common boundary line in such a way that the portion of the knot in each half plane is a properly embedded arc. The minimal number of such half planes is called the arc index of the knot. We have identified all prime knots with arc index up to 1…

The Turaev genus of a link can be thought of as a way of measuring how non-alternating a link is. A link is Turaev genus zero if and only if it is alternating, and in this viewpoint, links with large Turaev genus are very non-alternating. In this paper, we study Turaev genus one links, a class of links which includes a…

The study provides polynomial bounds for essential surfaces in various 3-manifolds.

Motivated by a result of L.P. Roberts on rational blow-downs in Heegaard-Floer homology, we study such operations along 3-manifolds that arise as branched double covers of $S^{3}$ along several non-alternating, slice knots.

Among non-alternating knots with $n\le 12$ crossings given in \cite{1} Turaev genus is not known for 191 knot. For 154 of them we show that they are almost alternating, so their Turaev genus is 1.

Using exhaustive techniques and results from Lackenby and many others, we compute the tunnel number of all 1655 alternating 11 and 12 crossing knots and of 881 non-alternating 11 and 12 crossing knots. We also find all 5525 Montesinos knots with 14 crossings or fewer.

We extend an approach of Beliakova for computing knot Floer homology and implement it in a publicly available computer program. We review the main programming and optimization methods used. Our program is then used to check that the Floer homology of a prime non-alternating knot with less than 12 crossings has no torsi…

As a supplement to the authors' article "Prime knots with arc index up to 11 and an upper bound of arc index for non-alternating knots", to appear in the Journal of Knot Theory and its Ramifications, we present minimal arc presentations of the prime knots up to arc index 11.

We present a combinatorial method for a calculation of knot Floer homology with Z-coefficient of (1,1)-knots, and then demonstrate it for non-alternating (1,1)-knots with ten crossings and the pretzel knots of type (-2,m,n). Our calculations determine the unknotting numbers and 4-genera of the pretzel knots of this typ…

We identify 998 closed hyperbolic 3-manifolds whose volumes are rationally related to Dedekind zeta values, with coprime integers $a$ and $b$ giving $a/b vol(M)=(-D)^{3/2}/(2π)^{2n-4} (ζ_K(2))/(2ζ(2))$ for a manifold M whose invariant trace field $K$ has a single complex place, discriminant $D$, degree $n$, and Dedekin…

A knot's thickness is measured by its β invariant, a new numerical invariant.

A state generating is introduced to determine the Jones polynomial of a link. Formulae for two infinite families of knots are shown by applying this method, the second family of which are proved to be non-alternating. Moreover, the method is generalized to compute the Jones-Kauffman polynomial of a virtual link. As exa…

We give sharp two-sided linear bounds of the crosscap number (non-orientable genus) of alternating links in terms of their Jones polynomial. Our estimates are often exact and we use them to calculate the crosscap numbers for several infinite families of alternating links and for several alternating knots with up to twe…

Study quantizes ropelength and writhe of 12-crossing knots.

In 1991, Negami found an upper bound on the stick number $s(K)$ of a nontrivial knot $K$ in terms of the minimal crossing number $c(K)$ of the knot which is $s(K) \leq 2 c(K)$. In this paper we improve this upper bound to $s(K) \leq \frac{3}{2} (c(K)+1)$. Moreover if $K$ is a non-alternating prime knot, then $s(K) \leq…

We use simple properties of the Rasmussen invariant of knots to study its asymptotic behaviour on the orbits of a smooth volume preserving vector field on a compact domain in the 3-space. A comparison with the asymptotic signature allows us to prove that asymptotic knots are non-alternating, in general. Further we show…

The aim of this article is to detect new classes of quasi-alternating links. Quasi-alternating links are a natural generalization of alternating links. Their knot Floer and Khovanov homology are particularly easy to compute. Since knot Floer homology detects the genus of a knot as well as whether a knot is fibered, as …

The lattice stick number $s_L(K)$ of a knot $K$ is defined to be the minimal number of straight line segments required to construct a stick presentation of $K$ in the cubic lattice. In this paper, we find an upper bound on the lattice stick number of a nontrivial knot $K$, except trefoil knot, in terms of the minimal c…

The Volume conjecture claims that the hyperbolic Volume of a knot is determined by the colored Jones polynomial. The purpose of this article is to show a Volume-ish theorem for alternating knots in terms of the Jones polynomial, rather than the colored Jones polynomial: The ratio of the Volume and certain sums of coeff…

The $\textit{volume density}$ of a hyperbolic link $K$ is defined to be the ratio of the hyperbolic volume of $K$ to the crossing number of $K$. We show that there are sequences of non-alternating links with volume density approaching $v_8$, where $v_8$ is the volume of the ideal hyperbolic octahedron. We show that the…

A classical result states that the determinant of an alternating link is equal to the number of spanning trees in a checkerboard graph of an alternating connected projection of the link. We generalize this result to show that the determinant is the alternating sum of the number of quasi-trees of genus j of the dessin o…

In this paper we show that the non-alternating torus knots are homologically thick, i.e. that their Khovanov homology occupies at least three diagonals. Furthermore, we show that we can reduce the number of full twists of the torus knot without changing certain part of its homology, and consequently, we show that there…

The paper refines transformations of lattice diagrams and introduces dotted diagrams.

Study completes braid index determination for all pretzel links.

This note explains how to transform Heegaard diagrams into framed link diagrams.

New minimal link diagrams found, including torus links and homogeneous ones.

We extend the theory of hyperbolicity of links in the 3-sphere to tg-hyperbolicity of virtual links, using the fact that the theory of virtual links can be translated into the theory of links living in closed orientable thickened surfaces. When the boundary surfaces are taken to be totally geodesic, we obtain a tg-hype…

Algorithm converts Kirby diagrams to trisection diagrams for 4-manifolds.

Kernelized Taylor diagram visualizes data populations with fewer assumptions.

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram by use of the double covering …

Study categorizes knots and links as rigid or shaky based on Reidemeister moves.

Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower bound for the virtual crossing number of virtual graph diagrams.

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link d…

Persistence diagrams are important descriptors in Topological Data Analysis. Due to the nonlinearity of the space of persistence diagrams equipped with their {\em diagram distances}, most of the recent attempts at using persistence diagrams in machine learning have been done through kernel methods, i.e., embeddings of …