The algebra of complete binary trees is affine complete

Abstract: A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of complete binary trees whose leaves are labeled by letters of an alphabet containing at least three letters a function is congruence preserving if and only if it is polynomial. This exhibits an example of a non commutative and non associative affine complete algebra. As far as we know, it is the first example of such an algebra.

This page was built for publication: The algebra of complete binary trees is affine complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6342354)