We determine the dimension of every simple module for the algebra of the monoid of all relations on a finite set (i.e. Boolean matrices). This is in fact the same question as the determination of the dimension of every evaluation of a simple correspondence ...
Let X be a finite set and let k be a commutative ring. We consider the k-algebra of the monoid of all relations on X, modulo the ideal generated by the relations factorizing through a set of cardinality strictly smaller than Card(X), called inessential rel ...
We classify all the simple modules for the algebra of relations on a finite set, give their dimension, and find the dimension of the Jacobson radical of the algebra. ...
Let G be a finite group and R be a commutative ring. The Mackey algebra μR(G) shares a lot of properties with the group algebra RG however, there are some differences. For example, the group algebra is a symmetric algebra and this is not always the case fo ...
We address the problem of conditional termination, which is that of defining the set of initial configurations from which a given program always terminates. First we define the dual set, of initial configurations from which a non-terminating execution exis ...