Related papers: Marked Graph Mosaics
This paper is a self-contained development of an invariant of graphs embedded in three-dimensional Euclidean space using the Jones polynomial and skein theory. Some examples of the invariant are computed. An unlinked embedded graph is one…
In [Z23], minimal tri-plane diagrams of surface-links listed in the Yoshikawa table are computed using ch-diagrams. In this paper, we obtain upper bounds for the L- and L*-invariants of several surface-links in the Yoshikawa table by using…
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…
We characterise the structure of those graphs of a given order which maximise the number of connected induced subgraphs for seven different graph classes, each with other prescribed parameters like minimum degree, independence number,…
We use grid diagrams to present a unified picture of braids, Legendrian knots, and transverse knots.
We extend our previous work from arXiv:1903.06863 on biquandle module invariants of oriented surface-links to the case of unoriented surface-links using bikei modules. The resulting infinite family of enhanced invariants proves be effective…
Analogous to a classical knot diagram, a surface-link can be generically projected to 3-space and given crossing information to create a broken sheet diagram. The triple point number of a surface-link is the minimal number of triple points…
We introduce multi-tribrackets, algebraic structures for region coloring of diagrams of knots and links with different operations at different kinds of crossings. In particular we consider the case of component multi-tribrackets which have…
We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…
A knot mosaic is a grid of pictorial tiles representing a tame knot or link. Recently, two groups independently introduced a new set of tiles. We call mosaics made with these new tiles corner mosaics. The (corner) tile number is the minimum…
In 2008, Lomonaco and Kauffman introduced a knot mosaic system to define a quantum knot system. A quantum knot is used to describe a physical quantum system such as the topology or status of vortexing that occurs on a small scale can not…
The present paper is a review of the current state of Graph-Link Theory (graph-links are also closely related to homotopy classes of looped interlacement graphs), dealing with a generalisation of knots obtained by translating the…
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.…
Laplacian matrices of weighted graphs in surfaces $S$ are used to define module and polynomial invariants of $Z/2$-homologically trivial links in $S \times [0,1]$. Information about virtual genus is obtained.
A k-digraph is an orientation of a multi-graph that is without loops and contains at most k edges between any pair of distinct vertices. We obtain necessary and sufficient conditions for a sequence of non-negative integers in non-decreasing…
We introduce a modified homology and cohomology theory for involutory biquandles (also known as \textit{bikei}). We use bikei 2-cocycles to enhance the bikei counting invariant for unoriented knots and links as well as unoriented 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…
The ideal (tagged resp.) triangulation of bounded surface with marked points are associated with skew-symmetric (skew-symmetrizable) exchange matrices. An algo- rithm is established to decompose the graph associated to such matrix. There…
We say that a link $L_1$ is an s-major of a link $L_2$ if any diagram of $L_1$ can be transformed into a diagram of $L_2$ by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime…
Unlabeled multigraphs have diverse applications across scientific fields, from transportation and social networks to polymer physics. In particular, multigraphs are essential for studying the relationship between the spatial organization…