加细幺半群与适应分离图
Refinement monoids and adaptable separated graphs
摘要:
定义了可分离图的一个子类,即适应可分离图类,并研究了它们的幺半群。我们表明,这些幺半群是素生成的圆锥精化幺半群,我们明确地确定其相关的I-系统。我们还证明了任何一个可重构生成的圆锥加细幺半群都可以表示为一个可适应分离图的幺半群。这些结果提供了第一步,对冯诺依曼正则环的实现问题的肯定回答,在生成的情况下。
英文摘要:
We define a subclass of separated graphs, the class of adaptable separated graphs, and study their associated monoids. We show that these monoids are primely generated conical refinement monoids, and we explicitly determine their associated I-systems. We also show that any finitely generated conical refinement monoid can be represented as the monoid of an adaptable separated graph. These results provide the first step toward an affirmative answer to the Realization Problem for von Neumann regular rings, in the finitely generated case.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。