Algebraic Operations & Quasigroup Structures

← Back to Domain-Specific Families

Abstractions about algebraic operations and the laws they satisfy, covering non-associative and partial-inverse structures (quasigroups, loops, orthodox semigroups), identity and inverse elements and permutation groups, operation-closure and order-compatible structures (clones, cyclically ordered groups, Heyting algebras), and combinatorial constructs like Hadamard matrices and zero-sum problems.

12 abstractions in this family — domain-specific abstractions that sit near one another in structural-signature space (k-means over structural-signature embeddings). Each is shown with its short description.

• BF Algebra — A type-(2,0) algebra with a distinguished zero and a binary operation satisfying self-cancellation, right-zero identity, and zero-mediated reversal.
• Clone (Universal Algebra) — Collect finitary operations on one carrier so that every projection is present and arbitrary finitary substitution of member operations produces another member.
• Cyclically Ordered Group — Equip a group with a ternary cyclic order that is preserved by multiplication on both sides, making the algebraic translations act as orientation-preserving symmetries of a circle-like order.
• Hadamard matrix — Arrange signs in a square matrix so every pair of distinct rows, and therefore columns, is orthogonal, equivalently satisfying the exact Gram identity \(HH^{\mathsf T}=nI\).
• Heyting Algebra — A bounded lattice whose implication is the right adjoint of meet, giving an algebraic semantics for intuitionistic reasoning.
• Inverse Element — An element of a specified monoid that composes with another element on both sides to give that monoid's identity.
• Loop (Algebra) — A quasigroup with a two-sided identity: multiplication has uniquely solvable left and right division without requiring associativity.
• Orthodox Semigroup — A regular semigroup whose idempotents are closed under multiplication, equivalently one in which chosen inverses of two factors compose in reverse order to an inverse of their product.
• Quasigroup — Equip a set with a closed binary operation for which either missing operand in an equation is uniquely recoverable, equivalently making every left and right translation a bijection, without requiring identity or associativity.
• Schützenberger Group — The permutation group induced on a semigroup H-class by its stabilizing translations, even when the H-class is not itself a group.
• Symmetric group — Form the group of every bijection from a set to itself under composition, with finite S_n containing n! permutations and organizing cycle type, parity, actions, and universal embeddings of finite groups.
• Zero-Sum Problem — Determine how long a sequence over a finite abelian group must be before a subsequence with zero group-sum and prescribed length properties is unavoidable.