Related papers: On the Coloring of Pseudoknots

Each ruling of a Legendrian link can be naturally treated as a surface. For knots, the ruling is 2-graded if and only if the surface is orientable. For 2-graded rulings of homogeneous (in particular, alternating) knots, we prove that the…

In this paper, we introduce the notion of pseudo-triangular norm (pseudo-t-norm, for short) as a classes of weakly associative operations on trellises and as a generalization of triangular norm (t-norm, for short) on bounded trellises and…

We ascertain conditions and structures on categories and semigroups which admit the construction of pseudo-products and trace products respectively, making their connection as precise as possible. This topic is modelled on the ESN Theorem…

In this paper, we define the concept of the Study-type determinant, and we present some properties of these determinants. These properties lead to some properties of the Study determinant. The properties of the Study-type determinants are…

In this paper, we give a method to evaluate minimum numbers of Dehn colors for knots by using symmetric local biquandle cocycle invariants. We give answers to some questions arising as a consequence of our previous paper [6]. In particular,…

This monograph derives direct and concrete relations between colored Jones polynomials and the topology of incompressible spanning surfaces in knot and link complements. Under mild diagrammatic hypotheses that arise naturally in the study…

We introduce algebraic structures known as psybrackets and use them to define invariants of pseudoknots and singular knots and links. Psybrackets are Niebrzydowski tribrackets with additional structure inspired by the Reidemeister moves for…

Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial…

There are 2^n possible resolutions of a smooth pseudodiagram with n precrossings. If we consider piecewise-linear (PL) pseudodiagrams and resolutions that themselves are PL, certain resolutions of the pseudodiagram may not exist in…

In this paper a classification of Reidemeister moves, which is the most refined, is introduced. In particular, this classification distinguishes some $\Omega_3$-moves that only differ in how the three strands that are involved in the move…

Two knots in three-space are S-equivalent if they are indistinguishable by Seifert matrices. We show that S-equivalence is generated by the doubled-delta move on knot diagrams. It follows as a corollary that a knot has trivial Alexander…

Historically originated as a sub-field of topology, knot theory is an active area of mathematical investigation that has strong connections with a diverse set of scientific fields such as algebra, biology, and statistical mechanics. A…

We define a $P$-compelling coloring as a proper coloring of the vertices of a graph such that every subset consisting of one vertex of each color has property $P$. The $P$-compelling chromatic number is the minimum number of colors in such…

In this monograph we provide an in-depth and systematic study of pseudolimits of pseudofunctors $F:\mathscr{C}^{op} \to \mathfrak{Cat}$ in the $2$-category of categories where $\mathscr{C}$ is a $1$-category and use this to give an explicit…

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…

This paper has two-fold goal: it provides gentle introduction to Knot Theory starting from 3-coloring, the concept introduced by R. Fox to allow undergraduate students to see that the trefoil knot is non-trivial, and ending with statistical…

Drawings of non-planar graphs always result in edge crossings. When there are many edges crossing at small angles, it is often difficult to follow these edges, because of the multiple visual paths resulted from the crossings that slow down…

Let $G$ denote a distance-regular graph with diameter $D\ge 3$, valency $k$, and intersection numbers $a_i$, $b_i$, $c_i$. By a {\it pseudo cosine sequence} of $G$ we mean a sequence of real numbers $s_0, s_1, ..., s_D$ such that $s_0=1$…

A colored graph is a directed graph in which nodes or edges have been assigned colors that are not necessarily unique. Observability problems in such graphs consider whether an agent observing the colors of edges or nodes traversed on a…

We outline the current status of the differential expansion (DE) of colored knot polynomials i.e. of their $Z$--$F$ decomposition into representation-- and knot--dependent parts. Its existence is a theorem for HOMFLY-PT polynomials in…