Hecke-Kiselman Monoids of Small Cardinality
Combinatorics
2016-11-11 v1
Abstract
In this paper, we give a characterization of digraphs such that the associated Hecke-Kiselman monoid is finite. In general, a necessary condition for to be a finite monoid is that is acyclic and its Coxeter components are Dynkin diagram. We show, by constructing examples, that such conditions are not sufficient.
Keywords
Cite
@article{arxiv.1206.5221,
title = {Hecke-Kiselman Monoids of Small Cardinality},
author = {Riccardo Aragona and Alessandro D'Andrea},
journal= {arXiv preprint arXiv:1206.5221},
year = {2016}
}