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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.