The well-known notion of associativity in algebra leads to structures with interesting properties, such as groups or semigroups. According to a paper by John Rhodes, some researchers in algebra and computational complexity are interested in extending this notion to obtain more general structures that retain certain properties of semigroups.

It seems that such a suggestion was made anonymously on this site, but I couldn't ascertain whether the definitition is well-founded and interesting. Therefore, I would like to know what other extensions of associativity are known, and which ones were successfully used in TCS, if any. I've heard about things like Moufang loops but couldn't wrap my mind around the defn, so any etra 'intuition' is welcome.

  • 1
    $\begingroup$ Whether others are interested in that definition, I personally think that the definition by @PilarLoof was interesting. But what leads you to pose the question? Is there any application or similar motivation in mind? $\endgroup$ Apr 6 '14 at 20:32
  • $\begingroup$ I don't know how closely it relates to the paper you mention, but one active area of algebra where non-associative structures are studied is the theory of operads (en.wikipedia.org/wiki/Operad_theory). $\endgroup$ Apr 7 '14 at 8:07

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.