The idempotent generated subsemigroup of the Kauffman monoid
arXiv:1602.01157 · doi:10.1017/S0017089516000471
Abstract
We characterise the elements of the (maximum) idempotent generated subsemigroup of the Kauffman monoid in terms of combinatorial data associated to certain normal forms. We also calculate the smallest size of a generating set and idempotent generating set.
10 pages, 1 figure; v2 incorporates referee's suggestions (to appear in Glasgow Math J)