Related papers: A Sliceness Criterion for Odd Free Knots
In this paper we give necessary and sufficient conditions for a knot type to admit non-loose Legendrian and transverse representatives in some overtwisted contact structure, classify all non-loose rational unknots in lens spaces, and…
Chord diagrams and related enlacement graphs of alternating knots are enhanced to obtain complete invariant graphs including chirality detection. Moreover, the equivalence by common enlacement graph is specified and the neighborhood graph…
In the present paper, we study arrangements of smooth plane conics having only nodes and tacnodes as the singularities. We provide an interesting estimation on the number of nodes and tacnodes that depends only on a linear function of the…
This paper is an exploration of simple four-regular graphs in the plane (i.e. loopless and with no more than one edge between any two nodes). Such graphs are fundamental to the theory of knots and links in three dimensional space, and their…
The notion of free link is a generalized notion of virtual link. In the present paper we define the group of free braids, prove the Alexander theorem that all free links can be obtained as closures of free braids and prove a Markov theorem,…
A geometric argument is given to prove that the Seifert genus of a positive knot equals its slice genus. A combinatorial invariant, giving a lower bound for the slice genus, is formulated for arbitrary knots. Properties and applications of…
In this note, we prove a lower bound for the positive kinkiness of a closed braid which we then use to derive an estimate for the positive kinkiness of a link in terms of its Seifert system. As an application, we show that certain pretzel…
A knot is a closed loop in space without self-intersection. Two knots are equivalent if there is a self homeomorphism of space bringing one onto the other. An arc presentation is an embedding of a knot in the union of finitely many half…
Given a graph G and an integer k, the objective of the $\Pi$-Contraction problem is to check whether there exists at most k edges in G such that contracting them in G results in a graph satisfying the property $\Pi$. We investigate the…
We provide theoretical insights around the cutwidth of a graph and the One-Sided Crossing Minimization (OSCM) problem. OSCM was posed in the Parameterized Algorithms and Computational Experiments Challenge 2024, where the cutwidth of the…
We define a set of "second-order" L^(2)-signature invariants for any algebraically slice knot. These obstruct a knot's being a slice knot and generalize Casson-Gordon invariants, which we consider to be "first-order signatures". As one…
The purpose of this paper is to present the critical cases of the trace theorems for the restriction of functions to closed surfaces, and to give the asymptotics for the norms of the traces under dilations of the surface. We also discuss…
We introduce two common divisor graphs associated with a finite skew brace, based on its $\lambda$- and $\theta$-orbits. We prove that the number of connected components is at most two and the diameter of a connected component is at most…
This paper contains the results of efforts to determine values of the smooth and the topological slice genus of 11- and 12-crossing knots. Upper bounds for these genera were produced by using a computer to search for genus one concordances…
We define cylinder knots as billiard knots in a cylinder. We present a necessary condition for cylinder knots: after dividing cylinder knots by possible rotational symmetries we obtain ribbon knots. We obtain an upper bound for the number…
Two new invariants that are closely related to Milnor's curvature-torsion invariant are introduced. The first, the spiral index of a knot, captures the minimum number of maxima among all knot projections that are free of inflection points.…
We address primary decomposition conjectures for knot concordance groups, which predict direct sum decompositions into primary parts. We show that the smooth concordance group of topologically slice knots has a large subgroup for which the…
We give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. The main theorem gives us a way to see if a given almost alternating link diagram represents a splittable link without increasing…
The Jones unknot conjecture states that the Jones polynomial distinguishes the unknot from nontrivial knots. We prove it for knots up to 23 crossings.
The splitting number of a link is the minimum number of crossing changes between distinct components that is required to convert the link into a split link. We provide a bound on the splitting number in terms of the four-genus of related…