Related papers: Delta Diagrams
To a singular knot K with n double points, one can associate a chord diagram with n chords. A chord diagram can also be understood as a 4-regular graph endowed with an oriented Euler circuit. L. Traldi introduced a polynomial invariant for…
We inductively define layers of colorings of knot and knotted surface diagrams using ternary quasigroups. Homological invariants from such systems of colorings use shorter differentials and of higher degree than the standard homology…
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.…
Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…
We show that if a knot admits a prime, twist-reduced diagram with at least 4 twist regions and at least 6 crossings per twist region, then every non-trivial Dehn filling of that knot is hyperbolike. A similar statement holds for links. We…
Comparability graphs are a popular class of graphs. We introduce as the digraph analogue of comparability graphs the class of comparability digraphs. We show that many concepts such as implication classes and the knotting graph for a…
Every 4-connected graph with minimum degree $\delta$ and connectivity $\kappa$ either has a cycle of length at least $4\delta-2\kappa$ or has a dominating cycle.
In this article we discuss applications of neural networks to recognising knots and, in particular, to the unknotting problem. One of motivations for this study is to understand how neural networks work on the example of a problem for which…
The $\Delta$-unknotting number for a knot is defined as the minimum number of $\Delta$-moves needed to deform the knot into the trivial knot. We determine the $\Delta$-unknotting numbers for two-bridge knots of type $C(2\beta_1, 2\beta_2,…
In previous work, we defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we look at the case when this graph is a tree, and we show that in many cases…
We generalize Milnor link invariants to all types of surface-links in $4$--space (possibly with boundary). This is achieved by using the notion of cut-diagram, which is a 2-dimensional generalization of Gauss diagrams, associated to…
A knot is an an embedding of a circle into three-dimensional space. We say that a knot is unknotted if there is an ambient isotopy of the embedding to a standard circle. By representing knots via planar diagrams, we discuss the problem of…
We consider ring extensions whose set of all subextensions is stable under the formation of sums, the so-called Delta extensions and exhibit new examples of these extensions.
We define a knot/link invariant using set theoretical solutions $(X,\sigma)$ of the Yang-Baxter equation and non commutative 2-cocycles. We also define, for a given $(X,\sigma)$, a universal group Unc(X) governing all 2-cocycles in $X$, and…
Let $\Delta$ be a $g_2$-minimal normal 3-pseudomanifold. A vertex in $\Delta$ whose link is not a sphere is called a singular vertex. When $\Delta$ contains at most two singular vertices, its combinatorial characterization is known [9]. In…
Link-homotopy and self Delta-equivalence are equivalence relations on links. It was shown by J. Milnor (resp. the last author) that Milnor invariants determine whether or not a link is link-homotopic (resp. self Delta-equivalent) to a…
A polynomial is presented that models a topological knot in a unique manner. It distinguishes all types of knots including the orientation and has a group theory interpretation. The topologies may be labeled via a number, which upon a base…
We introduce a new numerical knot invariant, termed the \textit{segment number}, which is derived from partitioned knot diagrams subject to specific over/under-crossing constraints. We prove that a knot is non-trivial if and only if its…
Let $G$ be a group, $\mathcal{P}_G$ be the family of all subsets of $G$. For a subset $A\subseteq G$, we put $\Delta(A)=\{g\in G:|gA\cap A|=\infty\}$. The mapping $\Delta:\mathcal{P}_G\rightarrow\mathcal{P}_G$, $A\mapsto\Delta(A)$, is…
A weaving knot is an alternating knot whose minimal diagram is a closed braid of a lattice-like pattern. In this paper, the warping degree of a braid diagram is defined, and upper bounds of the unknotting number and the region unknotting…