Hecke-Kiselman monoids of small cardinality. (Q1941747): Difference between revisions

Hecke-Kiselman monoids are certain monoids associated to simple digraphs and are defined in terms of generators and relations (generators are idempotents and they correspond to vertices of the digraph and relations are commutativity and certain braid-type relations associated to edges of the digraph). It is not known for which digraphs the corresponding Hecke-Kiselman monoids are finite. In the present paper the authors give a full classification of finite Hecke-Kiselman monoids associated to digraphs with at most four vertices. In particular, it is shown that the natural necessary condition (which involves a certain type of acyclicity together with the requirement that double edges form a disjoint union of Dynkin diagrams) is not sufficient.