The Coarse Structure of the Representation Algebra of a Finite Monoid
Author(s) -
Mary Schaps
Publication year - 2014
Publication title -
journal of discrete mathematics
Language(s) - English
Resource type - Journals
eISSN - 2090-9837
pISSN - 2090-9845
DOI - 10.1155/2014/529804
Subject(s) - algorithm , artificial intelligence , computer science
Let M be a monoid, and let L be a commutative idempotent submonoid. We show that we can find a complete set of orthogonal idempotents L^0 of the monoid algebra A of M such that there is a basis of A adapted to this set of idempotents which is in one-to-one correspondence with elements of the monoid. The basis graph describing the Peirce decomposition with respect to L^0 gives a coarse structure of the algebra, of which any complete set of primitive idempotents gives a refinement, and we give some criterion for this coarse structure to actually be a fine structure, which means that the nonzero elements of the monoid are in one-to-one correspondence with the vertices and arrows of the basis graph with respect to a set of primitive idempotents, with this basis graph being a canonical object
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom