arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.06409math.RA
收藏

关于幺半群的图积

On graph products of monoids

Yang Dandan, Victoria Gould

摘要:

幺半群的图积为直积和自由积以及图幺半群(也称为自由部分交换幺半群)提供了一个共同的框架。如果所讨论的幺半群是群,那么任何图积当然是群。对于不是群的幺半群,正则性可能是人们考虑的第一个也是最重要的代数性质;然而,正则幺半群的图积一般不是正则的。我们证明了正则幺半群的图积满足相关的,但较弱的,是丰富的条件。更一般地说,我们证明了左丰富和左喷泉幺半群类是封闭的下图的产品。抽象性和源泉性的概念以及它们的片面版本来自许多来源,例如,抽象性来自单演作用的投射性,源泉性(也称为弱抽象性)来自与有序范畴的联系。作为一个非常特殊的情形,我们得到了Fountain和Kambites的早期结果:右可消么半群的图积是右可消的。为了实现我们的目标,我们表明,(任意)图产品中的元素有一个独特的Foata标准形,并给出了一些有用的减少结果,这些可能同样适用于更广泛的情况下的幺半群群。

英文摘要:

Graph products of monoids provide a common framework for direct and free products, and graph monoids (also known as free partially commutative monoids). If the monoids in question are groups, then any graph product is, of course, a group. For monoids that are not groups, regularity is perhaps the first and most important algebraic property that one considers; however, graph products of regular monoids are not in general regular. We show that a graph product of regular monoids satisfies the related, but weaker, condition of being abundant. More generally, we show that the classes of left abundant and left Fountain monoids are closed under graph product. The notions of abundancy and Fountainicity and their one-sided versions arise from many sources, for example, that of abundancy from projectivity of monogenic acts, and that of Fountainicity (also known as weak abundancy) from connections with ordered categories. As a very special case we obtain the earlier result of Fountain and Kambites that the graph product of right cancellative monoids is right cancellative. To achieve our aims we show that elements in (arbitrary) graph products have a unique Foata normal form, and give some useful reduction results; these may equally well be applied to groups as to the broader case of monoids.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑