The idempotent generated subsemigroup of the Kauffman monoid
classification
🧮 math.GR
keywords
idempotentgeneratedgeneratingkauffmanmonoidsubsemigroupassociatedcalculate
read the original 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.
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.