Affine Completeness of Some Free Binary Algebras - Archive ouverte HAL Access content directly
Journal Articles Fundamenta Informaticae Year : 2022

Affine Completeness of Some Free Binary Algebras

, , (1)
1
André Arnold
  • Function : Author
Patrick Cégielski
  • Function : Author

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.

Dates and versions

hal-03774320 , version 1 (10-09-2022)

Identifiers

Cite

André Arnold, Patrick Cégielski, Irène Guessarian. Affine Completeness of Some Free Binary Algebras. Fundamenta Informaticae, 2022, 186 (1-4), pp.27-44. ⟨10.3233/FI-222117⟩. ⟨hal-03774320⟩
42 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More