  We classify and enumerate the idempotents in several planar diagram monoids:
namely, the Motzkin, Jones (a.k.a. Temperley-Lieb) and Kauffman monoids. The
classification is in terms of certain vertex- and edge-coloured graphs
associated to Motzkin diagrams. The enumeration is necessarily algorithmic in
nature, and is based on parameters associated to cycle components of these
graphs. We compare our algorithms to existing algorithms for enumerating
idempotents in arbitrary (regular *-) semigroups, and give several tables of
calculated values.

Combinatorics