相关论文: Small connected quandles
Quandles with good involutions, which are called symmetric quandles, can be used to define invariants of unoriented knots and links. In this paper, we determine the necessary and sufficient condition for good involutions of a generalized…
All quasi-affine connected Generalized Dynkin Diagram with rank $= 4$ are found. All quasi-affine Nichols (Lie braided) algebras with rank $ 4$ are also found.
We show that every thin position for a connected sum of small knots is obtained in an obvious way: place each summand in thin position so that no two summands intersect the same level surface, then connect the lowest minimum of each summand…
We characterize several properties of core quandles in terms of the properties of their underlying groups. Specifically, we characterize connected cores providing an answer to an open question in \cite{saito} and present a standard…
We provide the structure of some idempotents in the integral ring of a dihedral quandles, for odd case. The solution is complete in case $n=5$. This produces an example of a connected quandle $X$ such that $Aut (X)\not\cong Aut…
In this paper, we classify all the finite groups $G$ such that the commuting graph $\Gamma_C(G)$, order-sum graph $\Gamma_{OS}(G)$ and non-inverse graph $\Gamma_{NI}(G)$ are minimally edge connected graphs. We also classify all the finite…
This note gives necessary and sufficient conditions for a sequence of non-negative integers to be the degree sequence of a connected simple graph. This result is implicit in a paper of Hakimi. A new alternative characterisation of these…
Quandle homology was defined from rack homology as the quotient by a subcomplex corresponding to the idempotency, for invariance under the type I Reidemeister move. Similar subcomplexes have been considered for various identities of racks…
Coloring numbers are one of the simplest combinatorial invariants of knots and links to describe. And with Joyce's introduction of quandles, we can understand them more algebraically. But can we extend these invariants to tangles -- knots…
We define a family of generalizations of the two-variable quandle polynomial. These polynomial invariants generalize in a natural way to eight-variable polynomial invariants of finite biquandles. We use these polynomials to define a family…
Joyce has shown that the fundamental quandle of a classical knot can be derived from consideration of the fundamental group and the peripheral structure of the knot, and also that the group and much of the peripheral structure can be…
The purpose of this document is to provide data about known Betti numbers of unordered configuration spaces of small graphs in order to guide research and avoid duplicated effort. It contains information for connected multigraphs having at…
In this short note we highlight some of the differences between cube diagrams and grid diagrams. We also list examples of small cube diagrams for all knots up to 7 crossings and give some examples of links.
In this paper we give the results of a computer search for biracks of small size and we give various interpretations of these findings. The list includes biquandles, racks and quandles together with new invariants of welded knots and…
We incorporate quandle cocycle information into the quandle coloring quivers we defined in arXiv:1807.10465 to define weighted directed graph-valued invariants of oriented links we call \textit{quandle cocycle quivers}. This construction…
We show that every $3$-connected $K_{2,\ell}$-minor free graph with minimum degree at least $4$ has maximum degree at most $7\ell$. As a consequence, we show that every 3-connected $K_{2,\ell}$-minor free graph with minimum degree at least…
In this article we want to see that it is possible to iterate and generalize the notions presented in "Carlson's <_1-relation on the class of epsilon numbers" such that we can obtain the higher or thinner classes of ordinals induced by the…
A quandle is an algebraic structure whose binary operation is idempotent, right-invertible and right self-distributive. Right-invertibility ensures right translations are permutations and right self-distributivity ensures further they are…
This note closes a minor gap in the literature on the counting complexity of conjunctive queries by showing that queries that are not free-connex do not have a linear time counting algorithm under standard complexity assumptions. More…
For any minor-closed class of matroids over a fixed finite field, we state an exact structural characterization for the sufficiently connected matroids in the class. We also state a number of conjectures that might be approachable using the…