单调代数与图积
Monoid algebras and graph products
AI总结:
本文研究了图积中唯一第n次根和取消性质的扩展,利用单调代数和广义幂级数环进行证明。
摘要:
在本文中,我们将关于有限不连通图中唯一第n次根和取消性质的结果,从Cartesian积、强积和直接积扩展到根层次积以及一种修改的字典积。我们证明这些结果也适用于具有可数多个有限连通分量的图,只要每个连通分量只出现有限次(考虑同构)。证明方法是通过单调代数和广义幂级数环。
英文摘要:
In this note, we extend results about unique $n^{\textrm{th}}$ roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product, to the rooted hierarchical products, and to a modified lexicographic product. We show that these results also hold for graphs with countably many finite connected components, as long as every connected component appears only finitely often (up to isomorphism). The proofs are via monoid algebras and generalized power series rings.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。