Unital compressed commuting graph of 3 × 3 matrices over a finite prime field
Abstract
In this paper we completely describe the unital compressed commuting graph of the ring M3(GF(p)) of 3 × 3 matrices over the finite prime field GF(p). To achieve this we combine methods from linear algebra, field theory, projective geometry and combinatorics. We first partition the set of vertices into types based on the Jordan form and describe the neighborhood of each vertex. The key part of the graph, i.e., the subgraph that corresponds to non-scalar derogatory matrices, is then determined using a bijective correspondence between its vertices and point-line pairs in the projective plane over GF(p). At the end we explain how the remaining vertices are attached to the key part. We also give an algorithm to construct the whole graph. As a consequence, we describe the usual commuting graph (M3(GF(p))), whose structure was an open problem for several years.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.