Related papers: Constructing real rational knots by gluing
We prove an elementary method to classify, up to rigid isotopy, all nodal degree 4 real rational curves in $\mathbb{RP}^2$ that have only real double points. We show how to associate a chord diagram to a nodal real degree 4 planar rational…
We consider the question of when a rational homology 3-sphere is rational homology cobordant to a connected sum of lens spaces. We prove that every rational homology cobordism class in the subgroup generated by lens spaces is represented by…
Simple closed curves in the plane can be mapped to nontrivial knots under the action of origami foldings that allow the paper to self-intersect. We show all tame knot types may be produced in this manner, motivating the development of a new…
Let $F$ be an incompressible, meridionally incompressible and not boundary-parallel surface with boundary in the complement of an algebraic tangle $(B,T)$. Then $F$ separates the strings of $T$ in $B$ and the boundary slope of $F$ is…
We describe an algorithm that for every given braid $B$ explicitly constructs a function $f:\mathbb{C}^{2}\rightarrow\mathbb{C}$ such that $f$ is a polynomial in $u$, $v$ and $\overline{v}$ and the zero level set of $f$ on the unit…
We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its…
The knot concordance group can be contextualized as organizing problems about 3- and 4-dimensional spaces and the relationships between them. Every 3-manifold is surgery on some link, not necessarily a knot, and thus it is natural to ask…
Bonded knots arise naturally in topological protein modeling, where intramolecular interactions such as disulfide bridges stabilize folded configurations. These structures extend classical knot theory by incorporating embedded graphs, and…
Traditional symbolic reasoning engines, while attractive for their precision and explicability, have a few major drawbacks: the use of brittle inference procedures that rely on exact matching (unification) of logical terms, an inability to…
We combine the newly discovered technique, which computes explicit formulas for the image of an algebraic curve under rational transformation, with techniques that enable to compute braid monodromies of such curves. We use this combination…
Consider a simple algebraic group G of adjoint type, and its wonderful compactification X. We show that X admits a unique family of minimal rational curves, and we explicitly describe the subfamily consisting of curves through a general…
While the problem of knot classification is far from solved, it is possible to create computer programs that can be used to tabulate knots up to a desired degree of complexity. Here we discuss the main ideas on which such programs can be…
We discuss the possibility of the existence of finite algorithms that may give distinct knot classes. In particular we present two attempts for such algorithms which seem promising, one based on knot projections on a plane, the other on…
We address the problem of the maximal finite number of real points of a real algebraic curve (of a given degree and, sometimes, genus) in the projective plane. We improve the known upper and lower bounds and construct close to optimal…
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…
Given a knot or link in the form of plat closure of a braid, we describe an algorithm to obtain a braid representing the same knot or link with the standard closure, and vice-versa. We analyze the three cases of knots and links: in…
A torti-rational knot, denoted by K(2a,b|r), is a knot obtained from the 2-bridge link B(2a,b) by applying Dehn twists an arbitrary number of times, r, along one component of B(2a,b). We determine the genus of K(2a,b|r) and solve a question…
We describe a procedure that creates an explicit complex-valued polynomial function of three-dimensional space, whose nodal lines are the three-twist knot $5_2$. The construction generalizes a similar approach for lemniscate knots: a braid…
It is known that each of the successive quotient groups of the grope and solvable filtrations of the knot concordance group has an infinite rank subgroup. The generating knots of these subgroups are constructed using iterated doubling…
We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through…