Enumeration of idempotents in diagram semigroups and algebras

We give a characterisation of the idempotents of the partition monoid, and use this to enumerate the idempotents in the finite partition, Brauer and partial Brauer monoids, giving several formulae and recursions for the number of idempotents in each monoid as well as various R-, L- and D-classes. We...

Full description

Saved in:
Bibliographic Details
Published in:Journal of combinatorial theory. Series A 2015-04, Vol.131, p.119-152
Main Authors: Dolinka, Igor, East, James, Evangelou, Athanasios, FitzGerald, Des, Ham, Nicholas, Hyde, James, Loughlin, Nicholas
Format: Article
Language:English
Subjects:
Brauer algebras idempotents
Brauer monoids
Enumeration
Partition algebras
Partition monoids
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We give a characterisation of the idempotents of the partition monoid, and use this to enumerate the idempotents in the finite partition, Brauer and partial Brauer monoids, giving several formulae and recursions for the number of idempotents in each monoid as well as various R-, L- and D-classes. We also apply our results to determine the number of idempotent basis elements in the finite dimensional partition, Brauer and partial Brauer algebras.
ISSN:0097-3165
1096-0899
DOI:10.1016/j.jcta.2014.11.008