Affine completeness of the algebra of full binary trees

DOI10.1007/S00012-020-00690-6MaRDI QIDQ2217772zbMATH OpenOpenAlexFDO

Authors André Arnold, Serge Grigorieff, Patrick Cégielski, Irène Guessarian

Publication date 14 January 2021

Published in Algebra Universalis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00012-020-00690-6

zbMATH Keywords

affine completenesscongruencefull binary trees

Mathematics Subject Classification ID

Partial orders, general (06A06) Subalgebras, congruence relations (08A30) Free algebras (08B20)

Recommendations

• The algebra of binary trees is affine complete
• Affine complete varieties
• Congruence preserving functions on free monoids
• 2-affine complete algebras need not be affine complete.
• Congruence preserving functions of Wilke's tree algebras

Cites work

• Affinvollständige Moduln
• Boolean functions on distributive lattices
• Congruence preserving functions on free monoids
• Congruence-preserving functions on distributive lattices
• scientific article; zbMATH DE number 3639689 (Why is no real title available?)
• scientific article; zbMATH DE number 1557989 (Why is no real title available?)
• scientific article; zbMATH DE number 3217917 (Why is no real title available?)
• Lie algebras and Lie groups. 1964 lectures, given at Harvard University.
• Newton representation of functions over natural integers having integral difference ratios
• Produkte von Kongruenzklassengeometrien universeller Algebren
• Theory of Quasi-Groups

Cited in

(6)

• Congruence preserving functions on free monoids
• 2-affine complete algebras need not be affine complete.
• The algebra of binary trees is affine complete
• Affine Completeness of Some Free Binary Algebras
• Mathematical Foundations of Computer Science 2003
• Dense subtrees in complete Boolean algebras

This page was built for publication: Affine completeness of the algebra of full binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2217772)