arXiv · 2106.12846
Affine completeness of some free binary algebras
Abstract
A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. An algebra is said to be affine complete if every congruence preserving function is a polynomial function. We show that the algebra of (possibly empty) binary trees whose leaves are labeled by letters of an alphabet containing at least one letter, and the free monoid on an alphabet containing at least two letters are affine complete.
Explore related subjects
Keep this discovery
André Arnold, Patrick Cégielski, Irène Guessarian. 2021-06-24. Affine completeness of some free binary algebras. https://doi.org/10.3233/fi-222117
Cite the original work for its findings. Save a collection to share your selection of sources.