The algebra of binary trees is affine complete - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2021

The algebra of binary trees is affine complete

(1) , (2) , (3) , (3, 4)
1
2
3
4

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 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 a polynomial function, thus exhibiting the first example of a non commutative and non associative affine complete algebra.
Fichier principal
Vignette du fichier
AbAffineBz-final.pdf (261.71 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

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

Identifiers

Cite

André Arnold, Patrick Cégielski, Serge Grigorieff, Irène Guessarian. The algebra of binary trees is affine complete. Discrete Mathematics and Theoretical Computer Science, 2021, 23 (2), ⟨10.46298/dmtcs.6890⟩. ⟨hal-03774317⟩
16 View
4 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More