加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本