10.46298/fi-2022-8962
https://fi.episciences.org/8962
Arnold, André
André
Arnold
Cégielski, Patrick
Patrick
Cégielski
Guessarian, Irène
Irène
Guessarian
Affine completeness of some free binary algebras
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.
Comment: 18 pages
episciences.org
Mathematics - Rings and Algebras
Computer Science - Formal Languages and Automata Theory
06A99 - 08A30 - 08B20
F.4.m
arXiv.org - Non-exclusive license to distribute
2022-06-21
2022-10-21
2022-10-21
eng
journal article
arXiv:2106.12846
10.48550/arXiv.2106.12846
1875-8681
https://fi.episciences.org/8962/pdf
VoR
application/pdf
Fundamenta Informaticae
Volume 186, Issues 1-4: Trakhtenbrot's centenary
Researchers
Students