Related papers: Equivalence of symmetric union diagrams

In the study of ribbon knots, Lamm introduced symmetric unions inspired by earlier work of Kinoshita and Terasaka. We show an identity between the twisted Alexander polynomials of a symmetric union and its partial knot. As a corollary, we…

A symmetric union of two knots is a classical construction in knot theory which generalizes connected sum, introduced by Kinoshita and Terasaka in the 1950s. We study this construction for the purpose of finding an infinite family of…

An open question akin to the slice-ribbon conjecture asks whether every ribbon knot can be represented as a symmetric union. Next to this basic existence question sits the question of uniqueness of such representations. Eisermann and Lamm…

Motivated by the study of ribbon knots we explore symmetric unions, a beautiful construction introduced by Kinoshita and Terasaka in 1957. For symmetric diagrams we develop a two-variable refinement $W_D(s,t)$ of the Jones polynomial that…

We study the ribbon discs that arise from a symmetric union presentation of a ribbon knot. A natural notion of symmetric ribbon number is introduced and compared with the classical ribbon number. We show that the gap between these numbers…

We prove that all 2-bridge ribbon knots are symmetric unions.

We present a short proof of a theorem of Tanaka that if a composite ribbon knot admits a symmetric union presentation with one twisting region, then it has a non-trivial knot and its mirror image as connected summands.

Motivated by work of Kinoshita and Teraska, Lamm introduced the notion of a symmetric union, which can be constructed from a partial knot $J$ by introducing additional crossings to a diagram of $J \# -\!J$ along its axis of symmetry. If…

We show that a two-bridge ribbon knot $K(m^2 , m k \pm 1)$ with $m > k >0$ and $(m,k)=1$ admits a symmetric union presentation with partial knot which is a two-bridge knot $K(m,k)$. Similar descriptions for all the other two-bridge ribbon…

Eisermann and Lamm introduced a notion of symmetric equivalence among symmetric union diagrams and studied it using a refined form of the Jones polynomial. We introduced invariants of symmetric equivalence via refined versions of…

We present the results of Axel Seeliger's tabulation of symmetric union presentations for ribbon knots with crossing numbers 11 and 12 and exhibit possible examples for ribbon knots which are not representable as symmetric unions. In…

We classify all finite group actions on knots in the 3-sphere. By geometrization, all such actions are conjugate to actions by isometries, and so we may use orthogonal representation theory to describe three cyclic and seven dihedral…

We consider ribbon n-knots for n\geq 2. For such knots we define a set of moves on ribbon disks, and show that any two ribbon disks for isotopic knots are related by a finite sequence of such moves and ambient isotopies. Using this we are…

A quandle is an algebraic structure whose axioms correspond to the Reidemeister moves of knot theory. S. Kamada introduced the notion of a quandle with a good involution, which is later called a symmetric quandle. We are interested in the…

For prime knots $K_1$ and $K_2$, we write $K_1 \geq K_2$ if there is an epimorphism from the knot group of $K_1$ to that of $K_2$ which preserves the meridian. We construct a family of pairs of knots with $K_1 \geq K_2$ such that an…

Two skew diagrams are defined to be equivalent if their corresponding skew Schur functions are equal. The equivalence classes for ribbons have been classified by Billera, Thomas and van Willigenburg in 2006. In this paper, we provide a…

We study petal diagrams of knots, which provide a method of describing knots in terms of permutations in a symmetric group $S_{2n+1}$. We define two classes of moves on such permutations, called trivial petal additions and crossing…

Much of algebra and representation theory can be formulated in the general framework of tensor categories. The aim of this paper is to further develop this theory for braided tensor categories. Several results are established that do not…

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.…

In this paper we introduce a representation of knots and links called a cube diagram. We show that a property of a cube diagram is a link invariant if and only if the property is invariant under two types of cube diagram operations. A knot…