Antiassociative Groupoids
Abstract
Given a groupoid < G, >, and k ≥ 3, we say that G is antiassociative iff for all x1, x2, x3 ∈ G, (x1 x2) x3 and x1 (x2 x3) are never equal. Generalizing this, < G, > is k-antiassociative iff for all x1, x2, ... xk ∈ G, any two distinct expressions made by putting parentheses in x1 x2 x3 ...xk are never equal. We prove that for every k ≥ 3, there exist finite groupoids that are k-antiassociative. We then generalize this, investigating when other pairs of groupoid terms can be made never equal.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.