Graph products of right cancellative monoids

Simple item page
dc.creatorFountain, John
dc.creatorKambites, Mark
dc.date2008-03-14
dc.date.accessioned2026-07-07T09:26:52Z
dc.date.available2026-07-07T09:26:52Z
dc.descriptionOur 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.
dc.description24 pages
dc.identifierhttps://arxiv.org/abs/0803.2141
dc.identifierhttp://arxiv.org/abs/0803.2141
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/156906
dc.subjectRings and Algebras
dc.subject20M10; 20M05
dc.titleGraph products of right cancellative monoids
dc.typetext

Files

Collections

arXiv