Related papers: Signed ordered knotlike quandle presentations
It came to the attention of myself and the coauthors of (S., Rozowski, Silva, Rot, 2022) that a number of process calculi can be obtained by algebraically presenting the branching structure of the transition systems they specify. Labelled…
By using the cohomology theory of quandles, quandle cocycle invariants and shadow quandle cocycle invariants are defined for oriented links and surface-links via broken surface diagrams. By using symmetric quandles, symmetric quandle…
In our previous work [1] we described quantized computation using Horn clauses and based the semantics, dubbed as entanglement semantics as a generalization of denotational and distribution semantics, and founded it on quantum probability…
A cyclic presentation of a group is a presentation with an equal number of generators and relators that admits a particular cyclic symmetry. We characterise the orientable, non-orientable, and redundant cyclic presentations and obtain…
We develop some aspects of a general theory of presentations of subshifts by labelled directed graphs, in particular by compact graphs. Also considered are synchronization properties of subshifts that lead to presentations by countable…
When a boudnary-parabolic representation of a link group to PSL(2,$\mathbb{C}$) is given, Inoue and Kabaya suggested a combinatorial method to obtain the developing map of the representation using the octahedral triangulation and the…
We construct a virtual quandle for links in lens spaces $L(p,q)$, with $q=1$. This invariant has two valuable advantages over an ordinary fundamental quandle for links in lens spaces: the virtual quandle is an essential invariant and the…
We enhance the quandle coloring quiver invariant of oriented knots and links with quandle modules. This results in a two-variable polynomial invariant with specializes to the previous quandle module polynomial invariant as well as to the…
New presentations of a link and a virtual link are introduced and algebraic systems on links and virtual links are constructed respectively. Based on the algebraic systems, Reduction Crossing Algorithms for them are proposed which are used…
Signed difference sets have interesting applications in communications and coding theory. A $(v,k,\lambda)$-difference set in a finite group $G$ of order $v$ is a subset $D$ of $G$ with $k$ distinct elements such that the expressions…
Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…
Quantum link models are extensions of Wilson-type lattice gauge theories which realize exact gauge invariance with finite-dimensional Hilbert spaces. Quantum link models not only reproduce the standard features of Wilson's lattice gauge…
We extend Milnor's mu-invariants of link homotopy to ordered (classical or virtual) tangles. Simple combinatorial formulas for mu-invariants are given in terms of counting trees in Gauss diagrams. Invariance under Reidemeister moves…
Given a rank one measure-preserving system defined by cutting and stacking with spacers, we produce a rank one binary sequence such that its orbit closure under the shift transformation, with its unique {nonatomic} invariant probability, is…
The writhe polynomial is a fundamental invariant of an oriented virtual knot. We introduce a kind of local moves for oriented virtual knots called shell moves. The first aim of this paper is to prove that two oriented virtual knots have the…
Node representation learning for signed directed networks has received considerable attention in many real-world applications such as link sign prediction, node classification and node recommendation. The challenge lies in how to adequately…
We introduce the non-self OU sequence and the OU number for link diagrams. Using these, we give a lower bound for the number of necessary Reidemeister moves of type III between two diagrams of the same link.
We conduct a numerical investigation of structural order in the shifted-force Lennard-Jones system by calculating metrics of translational and bond-orientational order along various paths in the phase diagram covering equilibrium solid,…
The Reidemeister theorem states that any link in $3$-space can be encoded by a diagram (a suitably decorated projection) on a plane, and provides a finite set of combinatorial moves relating two diagrams of the same link up to isotopy. In…
Noting that cycle diagrams of permutations visually resemble grid diagrams used to depict knots and links in topology, we consider the knot (or link) obtained from the cycle diagram of a permutation. We show that the permutations which…