Related papers: Statistics on some classes of knot shadows
We enumerate the state diagrams of the twist knot shadow which consist of the disjoint union of two trivial knots. The result coincides with the maximal number of regions into which the plane is divided by a given number of circles. We then…
Given a 4-tangle shadow, we concatenate it with itself n times and form a knot by applying a closure operation that connects each top endpoint to the corresponding bottom endpoint on the same side without introducing any crossings. We then…
We show that for each even integer $m\ge 2$, every reduced shadow with sufficiently many crossings is a shadow of a torus knot T(2,m+1), or of a twist knot $T_m$, or of a connected sum of $m$ trefoil knots.
This is a PhD thesis about low dimensional topology, in particular knot thory in 3-manifolds also different from the 3-sphere, topological applications of quantum invariants, and Turaev's shadows. There is an introduction and a survey for…
This article provides the second part of the research initiated in arXiv:2411.17381, where we introduced and investigated so called periodicity shadows, which are special skew-symmetric matrices related to symmetric algebras with periodic…
We construct elements of the third quandle homology groups of knot quandles, which are called the shadow fundamental classes. They play the same roles for the shadow quandle cocycle invariants of knots as the fundamental classes of knot…
We define and compare several natural ways to compute the bridge number of a knot diagram. We study bridge numbers of crossing number minimizing diagrams, as well as the behavior of diagrammatic bridge numbers under the connected sum…
When two boundary-parabolic representations of knot groups are given, we introduce the connected sum of these representations and show several natural properties including the unique factorization property. Furthermore, the complex volume…
We introduce the warping crossing polynomial of an oriented knot diagram by using the warping degrees of crossing points of the diagram. Given a closed transversely intersected plane curve, we consider oriented knot diagrams obtained from…
The connected sum of two flat virtual knots depends on the choice of diagrams and basepoints. We show that any minimal crossing diagram of a composite flat virtual knot is a connected sum diagram. We also show the crossing number of flat…
We introduce shadow structures for singular knot theory. Precisely, we define \emph{two} invariants of singular knots and links. First, we introduce a notion of action of a singquandle on a set to define a shadow counting invariant of…
We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…
A shadow diagram is a knot diagram with under-over information omitted; a shadow movie is a sequence of shadow diagrams related by shadow Reidemeister moves. We show that not every shadow movie arises as the shadow of a Reidemeister movie,…
The paper addresses the $k$-tangle enumeration problem. We introduce a notion of cascade diagram for $k$-tangle projections. An effective enumeration algorithm for projections is proposed based on cascade representation. Tangles projections…
Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…
A rack shadow is a set X with a rack action by a rack R, analogous to a vector space over a field. We use shadow colorings of classical link diagrams to define enhanced rack counting invariants and show that the enhanced invariants are…
The contents of this 6-page paper have been subsumed into the 13-page paper, "A note on closed 3-braids", arXiv:0802.1072 [math.GT]. This paper is correct, but contains less information than the new one. The topological classification of…
We compute the Kauffman bracket polynomial of the numerator and denominator closures of A + A + ... + A ( A is repeated n times), where A is a 2-tangle shadow that has at most 4 crossings.
It is known that each knot has a semimeander diagram (i. e. a diagram composed of two smooth simple arcs), however the number of crossings in such a diagram can only be roughly estimated. In the present paper we provide a new estimate of…
We enumerate and show tables of minimal diagrams for all prime knots up to the triple-crossing number equal to five. We derive a minimal generating set of oriented moves connecting triple-crossing diagrams of the same oriented knot. We also…