Related papers: Arithmetic Kei Theory
The classical invariant theory for the queer Lie superalgebra $\mathfrak{q}_n$ investigates its invariants in the supersymmetric algebra $$\mathcal{U}_{s,l}^{r,k}:=\mathrm{Sym}\left(V^{\oplus r}\oplus \Pi(V)^{\oplus k}\oplus V^{*\oplus…
The notion of color algebras is generalized to the class of F-ary algebras, and corresponding decoloration theorems are established. This is used to give a construction of colored structures by means of tensor products with Clifford-like…
We investigate the coefficients of the highest and lowest terms (also called the head and the tail) of the colored Jones polynomial and show that they stabilize for alternating links and for adequate links. To do this we apply techniques…
A table of the families of alternating knots formed by conways is presented. The Conway's function is shown with the use of linear algebra in terms of natural numbers, called conways, that represent the number of crossings along a…
We show that the K_{2i}(Z[x]/(x^m),(x)) is finite of order (mi)!(i!)^{m-2} and that K_{2i+1}(Z[x]/(x^m),(x)) is free abelian of rank m-1. This is accomplished by showing that the equivariant homotopy groups of the topological Hochschild…
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…
We categorify the theory of Lie algebras beginning with a new notion of categorified vector space, or `2-vector space', which we define as an internal category in Vect, the category of vector spaces. We then define a `semistrict Lie…
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…
This is a report on our ongoing research on a combinatorial approach to knot recognition, using coloring of knots by certain algebraic objects called quandles. The aim of the paper is to summarize the mathematical theory of knot coloring in…
Maximal planar graph refers to the planar graph with the most edges, which means no more edges can be added so that the resulting graph is still planar. The Four-Color Conjecture says that every planar graph without loops is 4-colorable.…
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…
In this paper we use artificial neural networks to predict and help compute the values of certain knot invariants. In particular, we show that neural networks are able to predict when a knot is quasipositive with a high degree of accuracy.…
We give a characterization of finite sets of triples of elements (e.g., positive integers) that can be colored with two colors such that for every element $i$ in each color class there exists a triple which does not contain $i$. We give a…
We describe some regular techniques of calculating finite degree invariants of triple points free smooth plane curves $S^1 \to R^2$. They are a direct analog of similar techniques for knot invariants and are based on the calculus of {\em…
We generalize the $F_K$ invariant, i.e. $\widehat{Z}$ for the complement of a knot $K$ in the 3-sphere, the knots-quivers correspondence, and $A$-polynomials of knots, and find several interconnections between them. We associate an $F_K$…
We introduce \textit{dual graph diagrams} representing oriented knots and links. We use these combinatorial structures to define corresponding algebraic structures we call \textit{biquasiles} whose axioms are motivated by dual graph…
The First Fundamental Theorem of Invariant Theory describes a minimal generating set of the invariant polynomial ring under the action of some group $G$. In this note we give an elementary and direct proof for the $\operatorname{GL}_2(K)$…
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…
Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…
We define an algorithm k which takes a connected graph G on a totally ordered vertex set and returns an increasing tree R (which is not necessarily a subtree of G). We characterize the set of graphs G such that k(G)=R. Because this set has…