Bisymmetric and quasitrivial operations: characterizations and enumerations (Q2420598)

A binary operation \(\cdot\) on a non-void set \(M\) is called bisymmetric if it satisfies the identity \((xy)(zu)\approx(xz)(yu)\) and it is called quasitrivial if \(xy\in\{x,y\}\) for all \(x,y\in M\). Among others, the class of bisymmetric and quasitrivial binary operations and the subclass of bisymmetric, quasitrivial and order-preserving binary operations (with respect to some linear order on the corresponding base set) are characterized. For a finite base set, the sizes of these classes are determined.