{"docId":8962,"paperId":8962,"url":"https:\/\/fi.episciences.org\/8962","doi":"","journalName":"Fundamenta Informaticae","issn":"0169-2968","eissn":"1875-8681","volume":[{"vid":599,"name":"Volume 186, Issues 1-4: Trakhtenbrot's centenary"}],"section":[],"repositoryName":"arXiv","repositoryIdentifier":"2106.12846","repositoryVersion":3,"repositoryLink":"https:\/\/arxiv.org\/abs\/2106.12846v3","dateSubmitted":"2022-01-17 10:13:23","dateAccepted":"2022-06-21 22:10:59","datePublished":"2022-10-21 21:58:02","titles":["Affine completeness of some free binary algebras"],"authors":["Arnold, Andr\u00e9","C\u00e9gielski, Patrick","Guessarian, Ir\u00e8ne"],"abstracts":["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"],"keywords":["Mathematics - Rings and Algebras","Computer Science - Formal Languages and Automata Theory","06A99 - 08A30 - 08B20","F.4.m"]}