Related papers: Biquasiles and Dual Graph Diagrams
In the preprint of V. Bardakov, T. Kozlovskaya, D. Talalaev (Self-distributive bialgebras, arXiv:2501.19152) it was formulated a problem of classification of self-distributive bialgebras and was given classification of two-dimensional…
Circuit algebras, used in the study of finite-type knot invariants, are a symmetric analogue of Jones's planar algebras. They are very closely related to circuit operads, which are a variation of modular operads admitting an extra monoidal…
In earlier papers we introduced a representation of isotopy classes of compact surfaces embedded in the three-sphere by so called rectangular diagrams. The formalism proved useful for comparing Legendrian knots. The aim of this paper is to…
It is well-known that every vertex-transitive graph admits a representation as a coset graph. In this paper, we extend this construction by introducing monodromy graphs defined through double cosets. Our main result establishes that every…
In this paper we formalize a combinatorial object for describing link diagrams called a Planar Diagram Code. PD-codes are used by the KnotTheory Mathematica package developed by Bar-Natan, et al. We present the set of PD-codes as a stand…
We define an invariant of tangles and framed tangles given a finite crossed module and a pair of functions, called a Reidemeister pair, satisfying natural properties. We give several examples of Reidemeister pairs derived from racks,…
We present novel results related to isomorphic resonance graphs of 2-connected outerplane bipartite graphs. As the main result, we provide a structure characterization for 2-connected outerplane bipartite graphs with isomorphic resonance…
We introduce two new families of polynomial invariants of oriented classical and virtual knots and links defined as decategorfications of the quandle coloring quiver. We provide examples to illustrate the computation of the invariants, show…
A knot diagram has an associated looped interlacement graph, obtained from the intersection graph of the Gauss diagram by attaching loops to the vertices that correspond to negative crossings. This construction suggests an extension of the…
We define invariants of oriented surface-links by enhancing the biquandle counting invariant using \textit{biquandle modules}, algebraic structures defined in terms of biquandle actions on commutative rings analogous to Alexander…
We describe a graph parametrization of rational quadratic differentials with presence of a simple pole, whose critical trajectories form a network depending on parameters focusing on the network topological jumps. Obtained bifurcation…
This note is on the structures of line graphs and 2-variegated graphs. We have given here solutions of some graph equations involving line graphs and 2-variegated graphs.
There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While…
The present paper is an introduction to a combinatorial theory arising as a natural generalisation of classical and virtual knot theory. There is a way to encode links by a class of `realisable' graphs. When passing to generic graphs with…
In this chapter (Chapter V) we present several results which demonstrate a close connection and useful exchange of ideas between graph theory and knot theory. These disciplines were shown to be related from the time of Tait (if not Listing)…
A graph $G$ is a $D\!D_2$-graph if it has a pair $(D,D_2)$ of disjoint sets of vertices of $G$ such that $D$ is a dominating set and $D_2$ is a 2-dominating set of $G$. We provide several characterizations and hardness results concerning…
We use grid diagrams to present a unified picture of braids, Legendrian knots, and transverse knots.
We introduce the notion of a diagram category and discuss its application to the invariant theory of classical groups and super groups, with some indications concerning extensions to quantum groups and quantum super groups. Tensor functors…
Families of alternating knots (links) and tangles are studied using as building block the conway defined as the twisting of two strands. The regular representation of knots assumes the projection has the minimal number of overpassings, and…
We study set systems formed by neighborhoods in graphs of bounded twin-width. We start by proving that such graphs have linear neighborhood complexity, in analogy to previous results concerning graphs from classes with bounded expansion and…