Guardado en:
Detalles Bibliográficos
Autores principales: Karabulut, Yeşim Demiroğlu, Espinosa, Heriberto
Formato: Preprint
Publicado: 2026
Materias:
Acceso en línea:https://arxiv.org/abs/2605.05457
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866915986689490944
author Karabulut, Yeşim Demiroğlu
Espinosa, Heriberto
author_facet Karabulut, Yeşim Demiroğlu
Espinosa, Heriberto
contents In this paper, we investigate the spectrum of the unit-graph of the ring of $3 \times 3$ matrices over a finite field $\mathbb{F}_q$, which is equivalently the Cayley digraph $ \mathrm{Cay}\!\left((\mathrm{Mat}_3(\mathbb{F}_q),+), \mathrm{GL}_3(\mathbb{F}_q)\right)$. This unit-graph has a vertex set $\mathrm{Mat}_3(\mathbb{F}_q)$ with a directed edge from $A$ to $B$ whenever $B - A \in \mathrm{GL}_3(\mathbb{F}_q)$. Then, two vertices are adjacent precisely when their difference is invertible. With relevant character theory, we consequently demonstrate that the adjacency spectrum of $ \mathrm{Cay}\!\left((\mathrm{Mat}_3(\mathbb{F}_q),+), \mathrm{GL}_3(\mathbb{F}_q)\right) $ 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 $\mathrm{Mat}_3(\mathbb{F}_q)$ are sufficiently large, then there are matrices in the two subsets whose difference lies in $\mathrm{GL}_3(\mathbb{F}_q)$. In particular, any sufficiently large subset of $\mathrm{Mat}_3(\mathbb{F}_q)$ 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.
format Preprint
id arxiv_https___arxiv_org_abs_2605_05457
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Spectrum of the Unit-Graph on $\mathrm{Mat}_3(\mathbb{F}_q)$
Karabulut, Yeşim Demiroğlu
Espinosa, Heriberto
Combinatorics
05C50 (Primary) 15B33 (Secondary)
In this paper, we investigate the spectrum of the unit-graph of the ring of $3 \times 3$ matrices over a finite field $\mathbb{F}_q$, which is equivalently the Cayley digraph $ \mathrm{Cay}\!\left((\mathrm{Mat}_3(\mathbb{F}_q),+), \mathrm{GL}_3(\mathbb{F}_q)\right)$. This unit-graph has a vertex set $\mathrm{Mat}_3(\mathbb{F}_q)$ with a directed edge from $A$ to $B$ whenever $B - A \in \mathrm{GL}_3(\mathbb{F}_q)$. Then, two vertices are adjacent precisely when their difference is invertible. With relevant character theory, we consequently demonstrate that the adjacency spectrum of $ \mathrm{Cay}\!\left((\mathrm{Mat}_3(\mathbb{F}_q),+), \mathrm{GL}_3(\mathbb{F}_q)\right) $ 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 $\mathrm{Mat}_3(\mathbb{F}_q)$ are sufficiently large, then there are matrices in the two subsets whose difference lies in $\mathrm{GL}_3(\mathbb{F}_q)$. In particular, any sufficiently large subset of $\mathrm{Mat}_3(\mathbb{F}_q)$ 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.
title Spectrum of the Unit-Graph on $\mathrm{Mat}_3(\mathbb{F}_q)$
topic Combinatorics
05C50 (Primary) 15B33 (Secondary)
url https://arxiv.org/abs/2605.05457