pith. sign in

arxiv: 1902.05422 · v1 · pith:6ZUM74FQnew · submitted 2019-02-13 · 🧮 math.RT · math.CO· math.CT· math.GR· math.RA

The algebra of Boolean matrices, correspondence functors, and simplicity

classification 🧮 math.RT math.COmath.CTmath.GRmath.RA
keywords algebrabooleancorrespondencedimensioneveryfinitefunctorsmatrices
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.