GRAPH PRODUCTS OF RIGHT CANCELLATIVE MONOIDS

From MaRDI portal
Publication:3644371

DOI10.1017/S144678870900010XzbMATH Open1188.20071arXiv0803.2141OpenAlexW2962984093MaRDI QIDQ3644371FDOQ3644371

John Fountain, Mark Kambites

Publication date: 4 November 2009

Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)

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 specialise to the case of the inverse hulls of graph monoids, obtaining what we call polygraph monoids. Among other properties, we observe that polygraph monoids are F*-inverse. This follows from a general characterisation of those right cancellative monoids with inverse hulls that are F*-inverse.


Full work available at URL: https://arxiv.org/abs/0803.2141





Cites Work


Cited In (13)


Recommendations





This page was built for publication: GRAPH PRODUCTS OF RIGHT CANCELLATIVE MONOIDS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3644371)