$3$ -极大子幺半群的交
The Intersection of $3$-Maximal Submonids
摘要：
关于两个$k$生成的单词幺半群的交集的结构知之甚少，甚至对于$k=3$也是如此。在这里，我们调查的情况下，$k$ -极大幺半群，即幺半群的基数$k$不能被非平凡分解成最多$k$字。我们刻画了两个$3$ -极大幺半群的交。
英文摘要：
Very little is known about the structure of the intersection of two $k$-generated monoids of words, even for $k=3$. Here we investigate the case of $k$-maximal monoids, that is, monoids whose basis of cardinality $k$ cannot be non-trivially decomposed into at most $k$ words. We characterize the intersection in the case of two $3$-maximal monoids.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
