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

矩阵环的压缩交换图

Compressed commuting graphs of matrix rings

University of Banja Luka, Faculty of Architecture, Civil Engineering and Geodesy(班贾卢卡大学建筑、土木与大地测量学院);University of Ljubljana, School of Economics and Business(卢布尔雅那大学经济商学院);University of Ljubljana, Faculty of Civil and Geodetic Engineering(卢布尔雅那大学土木与大地测量工程学院)

Ivan-Vanja Boroja, Hamid Reza Dorbidi, Damjana Kokol Bukovšek, Nik Stopar

AI总结:

本文提出环的压缩交换图,通过合并生成相同子环的顶点构造,可诱导环范畴到图范畴的函子,证明其对有限域上矩阵代数是最优压缩,并计算了有限域及有限域上2×2矩阵环的对应压缩交换图。

摘要:

本文提出了环的压缩交换图概念。它可视为标准交换图(添加中心元素后的版本)的一种压缩形式,其中我们将生成相同子环的顶点视为同一顶点。该压缩的构造方式使其能诱导出一个从环范畴到图范畴的函子,这意味着我们的图不仅考虑环内的交换关系,还考虑其所有同态像中的交换关系。此外,我们证明对于有限域上的矩阵代数而言,这种压缩是最优的,即在仍能诱导函子的前提下实现了最大程度的压缩。我们计算了有限域以及有限域上2×2矩阵环的压缩交换图。

英文摘要:

In this paper we introduce compressed commuting graph of rings. It can be seen as a compression of the standard commuting graph (with the central elements added) where we identify the vertices that generate the same subring. The compression is chosen in such a way that it induces a functor from the category of rings to the category of graphs, which means that our graph takes into account not only the commutativity relation in the ring, but also the commutativity relation in all of its homomorphic images. Furthermore, we show that this compression is best possible for matrix algebras over finite fields, i.e., it compresses as much as possible while still inducing a functor. We compute the compressed commuting graphs of finite fields and rings of $2 \times 2$ matrices over finite fields.

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

↑