GRAPH PRODUCTS OF RIGHT CANCELLATIVE MONOIDS
John Fountain, Mark Kambites · Journal of the Australian Mathematical Society · 2009
Abstract Our first main result shows that a graph product of right cancellative monoids is itself right cancellative. If each of the component monoids satisfies the condition that the intersection of two principal left ideals is either principal or empty, then so does the graph product. Our second main result gives a presentation for the inverse hull of such a graph product. We then specialize to the case of the inverse hulls of graph monoids, obtaining what we call ‘polygraph monoids’. Among other properties, we observe that polygraph monoids areF*-inverse. This follows from a general characterization of those right cancellative monoids with inverse hulls that areF*-inverse.