Finitary conditions for graph products of monoids
Dandan Yang, Victoria Gould
Abstract
Graph products of monoids provide a common framework for free products and direct products. Trace monoids are graph products of finitely generated free monoids. We investigate the interaction of certain finitary conditions with graph products. Specifically, we examine the conditions of being weakly left noetherian (that is, every left ideal is finitely generated) and weakly left coherent (that is, every finitely generated left ideal has a finite presentation) and the related conditions of the ascending chain condition on principal left ideals, being left ideal Howson, and being finitely left equated. All of these conditions, and others, are preserved under retract; as a consequence, if a graph product has such a property, then so do all the constituent monoids. We show that the converse is also true for all the conditions listed except that of being weakly left noetherian. In the latter case we precisely determine the graph products of monoids which are weakly left noetherian.