Spectrum of the Unit-Graph on Mat3(Fq)
Abstract
In this paper, we investigate the spectrum of the unit-graph of the ring of 3 × 3 matrices over a finite field Fq, which is equivalently the Cayley digraph Cay\!((Mat3(Fq),+), GL3(Fq)). This unit-graph has a vertex set Mat3(Fq) with a directed edge from A to B whenever B - A ∈ GL3(Fq). Then, two vertices are adjacent precisely when their difference is invertible. With relevant character theory, we consequently demonstrate that the adjacency spectrum of Cay\!((Mat3(Fq),+), GL3(Fq)) consists of four distinct eigenvalues together with their multiplicities. Using the Spectral Gap Theorem for Cayley digraphs, we show that if two subsets of vertices in Mat3(Fq) are sufficiently large, then there are matrices in the two subsets whose difference lies in GL3(Fq). In particular, any sufficiently large subset of Mat3(Fq) contains two distinct matrices whose difference has nonzero determinant. This spectral gap implies that large vertex sets cannot avoid each other and must be connected by at least one edge.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.