Related papers: Hard Legendrian unknots

We present three "hard" diagrams of the unknot. They require (at least) three extra crossings before they can be simplified to the trivial unknot diagram via Reidemeister moves in $\mathbb{S}^2$. Both examples are constructed by applying…

In this study of the Reidemeister moves within the classical knot theory, we focus on hard diagrams of knots and links, categorizing them as either rigid or shaky based on their adaptability to certain moves. We establish that every link…

It was shown in arXiv:1208.5742 that any smooth knot can be represented by an \"ubercrossing projection, i.e. a knot projection with no crossings aside from a single multi-crossing. We extend this idea to Legendrian knots and investigate…

We prove that deciding if a diagram of the unknot can be untangled using at most $k$ Riedemeister moves (where $k$ is part of the input) is NP-hard. We also prove that several natural questions regarding links in the $3$-sphere are NP-hard,…

This paper gives infinitely many examples of unknot diagrams that are hard, in the sense that the diagrams need to be made more complicated by Reidemeister moves before they can be simplified. In order to construct these diagrams, we prove…

We introduce and study strongly invertible Legendrian links in the standard contact three-dimensional space. We establish the equivariant analogs of basic results separately well-known for strongly invertible and Legendrian links, i.e. the…

We investigate the question of the existence of a Lagrangian concordance between two Legendrian knots in $\mathbb{R}^3$. In particular, we give obstructions to a concordance from an arbitrary knot to the standard Legendrian unknot, in terms…

We define a new algebraic structure called Legendrian racks or racks with Legendrian structure, motivated by the front-projection Reidemeister moves for Legendrian knots. We provide examples of Legendrian racks and use these algebraic…

This paper develops a form of finite knot theory as a diagrammatic sequel to the ideal-stratum and deformation-persistence framework for knot types. Thick representatives in bounded ropelength sublevel spaces are studied through the finite…

We develop a reinforcement learning pipeline for simplifying knot diagrams. A trained agent learns move proposals and a value heuristic for navigating Reidemeister moves. The pipeline applies to arbitrary knots and links; we test it on…

Theory is developed for linear-quadratic at infinity generating families for Legendrian knots in R^3. It is shown that the unknot with maximal Thurston--Bennequin invariant of -1 has a unique linear-quadratic at infinity generating family,…

Mosaic tiles were first introduced by Lomonaco and Kauffman in 2008 to describe quantum knots, and have since been studied for their own right. Using a modified set of tiles, front projections of Legendrian knots can be built from mosaics…

Real Legendrian subvarieties are classical objects of differential geometry and classical mechanics and they have been studied since antiquity. However, complex Legendrian subvarieties are much more rigid and have more exceptional…

We establish the $\#P$-hardness of computing a broad class of immanants, even when restricted to specific categories of matrices. Concretely, we prove that computing $\lambda$-immanants of $0$-$1$ matrices is $\#P$-hard whenever the…

We determine a lower bound for the number of edges of a 2-connected maximal nontraceable graph, and present a construction of an infinite family of maximal nontraceable graphs that realize this bound.

Given a Legendrian knot $\Lambda \subset \mathbb{R}^3$ and a vertical line dividing the front projection of $\Lambda$ into two halves, we construct a differential graded algebra associated to each half-knot. We then show that one may obtain…

We define a differential graded algebra associated to Legendrian knots in thickened convex surfaces $\Sigma\times \mathbb{R}$. The algebra is defined in the same spirit as the Chekanov-Eliashberg DGA for Legendrians in $\mathbb{R}^3$, but…

We prove that any diagram of the unknot with c crossings may be reduced to the trivial diagram using at most (236 c)^{11} Reidemeister moves. Moreover, every diagram in this sequence has at most (7 c)^2 crossings. We also prove a similar…

We present classification results for exceptional Legendrian realisations of torus knots. These are the first results of that kind for non-trivial topological knot types. Enumeration results of Ding-Li-Zhang concerning tight contact…

In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…