The Convolution Algebra
Abstract
For a complete lattice and a relational structure , we introduce the convolution algebra . This algebra consists of the lattice equipped with an additional -ary operation for each -ary relation of . For and we set . For the 2-element lattice , is the reduct of the familiar complex algebra 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 is the reduct of a complete Heyting algebra, the operations of are completely additive in each coordinate and is in the variety generated by . 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.
Keywords
Cite
@article{arxiv.1702.02847,
title = {The Convolution Algebra},
author = {John Harding and Carol Walker and Elbert Walker},
journal= {arXiv preprint arXiv:1702.02847},
year = {2017}
}