Papers
Topics
Authors
Recent
Search
2000 character limit reached

The algebra of Boolean matrices, correspondence functors, and simplicity

Published 13 Feb 2019 in math.RT, math.CO, math.CT, math.GR, and math.RA | (1902.05422v1)

Abstract: 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 functor. The method uses the theory of such functors developed in [BT2, BT3], as well as some new ingredients in the theory of finite lattices.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.