关于交换图的最大距离
On maximal distances in a commuting graph
摘要:
研究了定义在代数闭域上的矩阵代数交换图的最大距离。特别地,我们证明了最大距离只能在两个非减损矩阵之间达到。我们还利用交换图中的距离描述了秩一矩阵和半单矩阵。
英文摘要:
We study maximal distances in the commuting graphs of matrix algebras defined over algebraically closed fields. In particular, we show that the maximal distance can be attained only between two nonderogatory matrices. We also describe rank-one and semisimple matrices using the distances in the commuting graph.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。