REVIEW 2 cited by
The rack congruence condition and half congruences in racks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Racks and quandles are algebraic structures with a single binary operation that is right self-distributive and right invertible, and additionally idempotent in the case of quandles. The invertibility condition is equivalent to the existence of a second binary operation that acts as a right inverse to the first, so that racks and quandles may also be viewed as algebraic structures with a pair of (dependent) binary operations. When forming a quotient rack or quandle it is necessary to take this two-operation view, and define a congruence as an equivalence relation on the rack or quandle that respects both operations. However, in defining a congruence some authors have omitted the condition on the inverse operation, and defined a congruence as an equivalence relation respecting the primary operation only. We show that while respecting the primary operation is sufficient in the case of finite racks and quandles, it is not in general sufficient in the infinite case. We do this by constructing explicit examples of "half congruences": equivalence relations that respect exactly one of the two operations. Our work also allows us to completely characterise congruences in connected Alexander quandles.
Forward citations
Cited by 2 Pith papers
-
Burnside rings for racks and quandles
Finite racks and quandles are shown to have Burnside rings whose additive basis is the connected racks, with separating marks and links to crossed Burnside rings and Dress-Siebeneicher theory.
-
Classification and structure of generalized Legendrian racks
Generalized Legendrian racks are equivalent as a category to ordinary racks, with explicit GL-structure classifications and computer enumeration up to order 8.
Discussion (0). Continue with ORCID to comment.