Abstract
We characterise the elements of the (maximum) idempotent-generated subsemigroup of the Kauffman monoid in terms of combinatorial data associated with certain normal forms. We also calculate the smallest size of a generating set and idempotent generating set.
Original language | English |
---|---|
Pages (from-to) | 673-683 |
Number of pages | 11 |
Journal | Glasgow Mathematical Journal |
Volume | 59 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2017 |
Keywords
- Kauffman, Louis H., 1945-
- idempotents
- monoids
- semigroups