We study and compare two factorization systems for surjective homomorphisms in the category of quandles. The first one is induced by the adjunction between quandles and trivial quandles, and a precise description of the two classes of morphisms of this factorization system is given. In doing this we observe that a special class of congruences in the category of quandles always permute in the sense of the composition of relations, a fact that opens the way to some new universal algebraic investigations in the category of quandles. The second factorization system is the one discovered by E. Bunch, P. Lofgren, A. Rapp and D. N. Yetter. We conclude with an example showing a difference between these factorization systems
A quandle is a set with a binary operation that satisfies three axioms that corresponds to the three...
Racks and quandles are rich algebraic structures that are strong enough to classify knots. Here we d...
Contents Introduction 1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
Quandles are mathematical structures that have been mostly studied in knot theory, where they determ...
E. Bunch, P. Lofgren, A. Rapp and D. N. Yetter [J. Knot theory Ramifications (2010)] pointed out tha...
Quandles are distributive algebraic structures originally introduced independently by David ...
AbstractWe introduce the concept of the quandle partial derivatives, and use them to define extreme ...
We show that quandle coverings in the sense of Eisermann form a (regular epi)-reflective subcategory...
Factorization algebras, and factorization homology, began in the work of Beilinson-Drinfeld, as an a...
Quandles are distributive algebraic structures that were introduced by David Joyce [24] in his P...
We study the difference between quandles that arise from conjugation in groups and those which do no...
We prove that the automorphism group of the dihedral quandle with n elements is isomorphic to the af...
Knot theory has rapidly expanded in recent years. New representations of braid groups led to an extr...
Let M, N be monoids, and PSh(M), PSh(N) their respective categories of right actions on sets. In thi...
AbstractIt is known that factorisation systems in categories can be viewed as unitary pseudo-algebra...
A quandle is a set with a binary operation that satisfies three axioms that corresponds to the three...
Racks and quandles are rich algebraic structures that are strong enough to classify knots. Here we d...
Contents Introduction 1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
Quandles are mathematical structures that have been mostly studied in knot theory, where they determ...
E. Bunch, P. Lofgren, A. Rapp and D. N. Yetter [J. Knot theory Ramifications (2010)] pointed out tha...
Quandles are distributive algebraic structures originally introduced independently by David ...
AbstractWe introduce the concept of the quandle partial derivatives, and use them to define extreme ...
We show that quandle coverings in the sense of Eisermann form a (regular epi)-reflective subcategory...
Factorization algebras, and factorization homology, began in the work of Beilinson-Drinfeld, as an a...
Quandles are distributive algebraic structures that were introduced by David Joyce [24] in his P...
We study the difference between quandles that arise from conjugation in groups and those which do no...
We prove that the automorphism group of the dihedral quandle with n elements is isomorphic to the af...
Knot theory has rapidly expanded in recent years. New representations of braid groups led to an extr...
Let M, N be monoids, and PSh(M), PSh(N) their respective categories of right actions on sets. In thi...
AbstractIt is known that factorisation systems in categories can be viewed as unitary pseudo-algebra...
A quandle is a set with a binary operation that satisfies three axioms that corresponds to the three...
Racks and quandles are rich algebraic structures that are strong enough to classify knots. Here we d...
Contents Introduction 1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...