2000 character limit reached
The idempotent generated subsemigroup of the Kauffman monoid (1602.01157v2)
Published 2 Feb 2016 in math.GR
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.