2. The algebra of binary trees

Toute utilisation commerciale ou impression systématique est consti- tutive d’une infraction pénale.. Toute copie ou impression de ce fichier doit conte- nir la présente mention

The join operation is used for the generation of every element of ~’n from binary trees with. less vertices. Indeed

We show that on the algebra of full binary trees whose leaves are labeled by letters of an alphabet containing at least three letters, a function is congruence preserving if and only

In this paper we study representations of skew group algebras ΛG, where Λ is a connected, basic, finite-dimensional algebra (or a locally finite graded algebra) over an

Since there are no binary trees with an even number of vertices, it would perhaps be useful to consider inead binary trees with k leaves (a leaf being a vertex without a

- Though the rotation lattice of binary trees is not a modular lattice^ we show that its Möbius fonction jx can be computed as f or distributive lattices.. - Bien que le treillis

If the length of the deque list is equal to k and the triple at the bottom of the deque is (x, y, t), then (x y y, t) is removed from the deque, (x,y) is stored in an empty

Write a degree 2 polynomial with integer coefficients having a root at the real number whose continued fraction expansion is. [0; a,