On idempotent and hyperassociative structures
An algebra with binary operations is called a binary algebra. A binary algebra \((Q;\Sigma)\) is said to be 1) hyperassociative if \(X(x,Y(y,z))=Y(X(x,y),z)\) for every operations \(X,Y\in\Sigma\), 2) rectangular if \(X(x,X(y,x))=x\) for every operation \(X\in\Sigma\). The main result of the paper under review is Theorem 4. Let \((Q;\Sigma)\) be an idempotent and hyperassociative binary algebra. Then if there exists on it such a congruence that corresponding quotient algebra is a rectangular semigroup and operations of the set are semilattice operations on each equivalence class then \((Q;\Sigma)\) satisfies the transitive commutativity property \(X(x,y)=X(y,x)\) and \(X(y,z)=X(z,y)\Rightarrow X(x,z)=X(z,x)\).
- scientific article; zbMATH DE number 3122413 (Why is no real title available?)
- scientific article; zbMATH DE number 3162939 (Why is no real title available?)
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 44051 (Why is no real title available?)
- scientific article; zbMATH DE number 46665 (Why is no real title available?)
- scientific article; zbMATH DE number 49297 (Why is no real title available?)
- scientific article; zbMATH DE number 3419181 (Why is no real title available?)
- scientific article; zbMATH DE number 3198815 (Why is no real title available?)
- Hyperidentities and related concepts. I
- Hyperidentities and related concepts. II
- Hyperidentities in algebras and varieties
- Idempotent semigroups with transitive commutativity relation.
This page was built for publication: On idempotent and hyperassociative structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010165)