Related papers: Picture-valued parity-biquandle bracket II. Exampl…

This paper introduces new invariants of rigid vertex graph embeddings by using non-local combinatorial information that is available at each graphical node. The new non-local information that we use in this paper involves parity in the…

We investigate an application of crossing parity for the bracket expansion of the Jones polynomial for virtual knots. In addition we consider an application of parity for the arrow polynomial as well as for the categorifications of both…

We give examples of knots with some unusual properties of the crossing number of positive diagrams or strand number of positive braid representations. In particular we show that positive braid knots may not have positive minimal (strand…

We define a family of formal Khovanov brackets of a colored link depending on two parameters. The isomorphism classes of these brackets are invariants of framed colored links. The Bar-Natan functors applied to these brackets produce…

In this paper we develop a structure called Link Algebra, in which we present a Set with two binary operations and an axiom system developed from the study of graph theory and set/antiset theory, sowing main theorems and definitions. Once…

We prove that parities on virtual knots come from invariant 1-cycles on the arcs of knot diagrams. In turn, the invariant cycles are determined by quasi-indices on the crossings of the diagrams. The found connection between the parities and…

We associate at each link a connectivity space which describes its splittability properties. Then, the notion of order for finite connectivity spaces results in the definition of a new numerical invariant for links, their connectivity…

We observe that for planar graphs, the geometric duality relation generates both 2-isomorphism and abstract duality. This observation has the surprising consequence that for links, the equivalence relation defined by isomorphisms of…

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…

A group-theoretical method, via Wada's representations, is presented to distinguish Kishino's virtual knot from the unknot. Biquandles are constructed for any group using Wada's braid group representations. Cocycle invariants for these…

We strengthen and put in a broader perspective previous results of the first two authors on colliding permutations. The key to the present approach is a new non-asymptotic invariant for graphs.

We define a generalization of virtual links to arbitrary dimensions by extending the geometric definition due to Carter et al. We show that many homotopy type invariants for classical links extend to invariants of virtual links. We also…

Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…

We work with a generalization of knot theory, in which one diagram is reachable from another via a finite sequence of moves if a fixed condition, regarding the existence of certain morphisms in an associated category, is satisfied for every…

We prove that every graph of rank-width $k$ is a pivot-minor of a graph of tree-width at most $2k$. We also prove that graphs of rank-width at most 1, equivalently distance-hereditary graphs, are exactly vertex-minors of trees, and graphs…

We say that a graph $G$ is $(2,m)$-linked if, for any distinct vertices $a_1,\ldots, a_m, b_1,b_2$ in $G$, there exist vertex disjoint connected subgraphs $A,B$ of $G$ such that $\{a_1, \ldots, a_m\}$ is contained in $A$ and $\{b_1,b_2\}$…

We consider two well known constructions of link invariants. One uses skein theory: you resolve each crossing of the link as a linear combination of things that don't cross, until you eventually get a linear combination of links with no…

The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…

We say that a graph is intrinsically non-trivial if every spatial embedding of the graph contains a non-trivial spatial subgraph. We prove that an intrinsically non-trivial graph is intrinsically linked, namely every spatial embedding of…

We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…