• Corpus ID: 226282402

The algebra of binary trees is affine complete

@article{Arnold2021TheAO,
  title={The algebra of binary trees is affine complete},
  author={Andr{\'e} Arnold and Patrick C{\'e}gielski and Serge Grigorieff and Ir{\`e}ne Guessarian},
  journal={Discret. Math. Theor. Comput. Sci.},
  year={2021},
  volume={23}
}
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 polynomial. 
View PDF on arXiv

Figures from this paper

References

SHOWING 1-10 OF 14 REFERENCES
République Populaire Roumaine
  • Colloq. Math. 25,
  • 1972
Affine completeness of the algebra of full binary trees
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 full binary trees whose…
Boolean functions on distributive lattices
Congruence-preserving functions on distributive lattices
Abstract.This paper is a continuation of the research motivated by G. Grätzer’s study of affine completeness for Boolean algebras and distributive lattices from 1962 and 1964, respectively and by the…
Algebraic functions on p-rings
Polynomial Completeness in Algebraic Systems
ALGEBRAS, LATTICES, AND VARIETIES Algebras, Languages, Clones, Varieties Congruence Properties CHARACTERIZATIONS OF EQUIVALENCE LATTICES Introduction Arithmeticity Compatible Function Lifting…
Newton representation of functions over natural integers having integral difference ratios
TLDR
This class of functions from natural integers to integers: those which have integral difference ratios, i.e. verifying f(a) - f(b) ≡ 0 (mod (a - b)) for all a > b is characterized via their representations as Newton series.
Arnold LABRI, UMR 5800, Université Bordeaux, France. e-mail: andre.arnold@club-internet.fr Patrick Cégielski LACL, EA 4219
  • Produkte von KongruenzenKlassengeometrien universeller Algebren. Math. Z. 121,
  • 1971
As g is WCP and h( u) = h( v), hence h(g( u)) = h(g( v)). Then by Lemma 1.3 (unique decomposition) we get h(g i ( u)) = h(g i ( v)) for i = 1, 2. As this is true for any h
  • Similarly, h(g( v)) = h(g 1 ( v)) ⋆ h
Σ, we have shown that there exists a polynomial P g , which is either a constant a ∈ Σ or an x i , such that g = P g
  • As CP functions are WCP
...
...