The convolution algebra

For L a complete lattice L and X = (X, (R-i)(I)) a relational structure, we introduce the convolution algebra L-X. This algebra consists of the lattice L-x equipped with an additional n(i)-ary operation f(i) for each n(i) + 1-ary relation R-i of X. For alpha(1), . . . ,alpha(ni) is an element of L-x and x is an element of X we set f(i)(alpha(1), . . ., alpha(ni))(x) =V {alpha(1)(x(1)) Lambda . . . Lambda alpha(ni) (x(ni)) :,(x(1), . . .,x(ni),x) is an element of R-i} For the 2-element lattice 2, 2(x) is the reduct of the familiar complex algebra X+ obtained by removing Boolean complementation from the signature. It is shown that this construction is bifunctorial and behaves well with respect to one-one and onto maps and with respect to products. When L is the reduct of a complete Heyting algebra, the operations of L-x are completely additive in each coordinate and L-x is in the variety generated by 2(x). Extensions to the construction are made to allow for completely multiplicative operations defined through meets instead of joins, as well as modifications to allow for convolutions of relational structures with partial orderings. Several examples are given.