Related papers: A Generalization of Pretzel Links via Spatial Grap…
Pseudo links are equivalence classes under Reidemeister-type moves of link diagrams containing crossings with undefined over and under information. In this paper, we extend the Kauffman bracket and Jones-type polynomials from planar pseudo…
Twisted torus links are given by twisting a subset of strands on a closed braid representative of a torus link. T--links are a natural generalization, given by repeated positive twisting. We establish a one-to-one correspondence between…
We calculate the twisted Alexander polynomials of $(-2,3,2n+1)$-pretzel knots associated to their holonomy representations. As a corollary, we obtain new supporting evidences of Dunfield, Friedl and Jackson's conjecture, that is, the…
A link diagram can be considered as a $4$-valent graph embedded in the $2$-sphere and divides the sphere into complementary regions. In this paper, we show that any link has a diagram with only triangles and quadrilaterals. This extends…
Given a homomorphism from a knot group to a fixed group, we introduce an element of a $K_1$-group, which is a generalization of (twisted) Alexander polynomials. We compare this $K_1$-class with other Alexander polynomials. In terms of…
Tied links and the tied braid monoid were introduced recently by the authors and used to define new invariants for classical links. Here, we give a version purely algebraic-combinatoric of tied links. With this new version we prove that the…
Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…
The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…
We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…
Kuperberg introduced web spaces for some Lie algebras which are generalizations of the Kauffman bracket skein module on a disk with marked points. We derive some formulas for $A_1$ and $A_2$ clasped web spaces by graphical calculus using…
In the present paper, we construct the generalized Kuperberg bracket for two-component links with one component fibred. We consider a new geometrical complexity for such links and establish minimality of diagrams in a strong sense.
Every link is shown to be presentable as a boundary of an unknotted flat banded surface. A (flat) banded link is defined as a boundary of an unknotted (flat) banded surface. A link's (flat) band index is defined as the minimum number of…
We use crossing parity to construct a generalization of biquandles for virtual knots which we call Parity Biquandles. These structures include all biquandles as a standard example referred to as the even parity biquandle. Additionally, we…
This paper introduces a new algebra, the crossing algebra, that is applied to count the number of components for arborescent knots, links, tangles or states (of a state polynomial expansion such as the Kauffman bracket). This algebra is…
In this paper, we establish a connection between Apollonian packings and knot theory. We introduce new representations of links realized in the tangency graph of the regular crystallographic sphere packings. Particularly, we prove that any…
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…
In this article we give necessary and sufficient conditions for two triples of integers to be realized as the Thurston-Bennequin number and the rotation number of a Legendrian theta-graph with all cycles unknotted. We show that these…
We extend the Wirtinger number of links, an invariant originally defined by Blair, Kjuchukova, Velazquez, and Villanueva in terms of extending initial colorings of some strands of a diagram to the entire diagram, to spatial graphs. We prove…
In 1986, Oliver Pretzel studied the set of orientations of a connected finite graph $G$ and showed that any two such orientations having the same flow-difference around all closed loops can be obtained from one another by a succession of…
Mutual visibility in graphs provides a framework for analysing how vertices can observe one another along shortest paths free of internal obstructions. The visibility polynomial, which enumerates mutual-visibility sets of all orders, has…