SearcharxivSearch

arXiv · 2607.26320

The Automorphism Group of the Spectral Incidence Graph over Finite Fields

Abstract

Let $\mathbb{F}_q$ be a finite field with $q$ elements and let $\mathbb{V}_0=\mathbb{F}_q^n$ be the $n$-dimensional vector space over $\mathbb{F}_q$, for an integer $n\geq2$. We introduce the \emph{spectral incidence graph} of $\mathbb{V}_0$, denoted by $\mathbf{SIG}(\mathbb{V}_0)$, a bipartite graph whose two vertex classes consist of the one-dimensional subspaces of $M_n(\mathbb{F}_q)$ generated by matrices having at least one eigenvector in $\mathbb{V}_0$, and the one-dimensional subspaces of $\mathbb{V}_0$ (i.e. the projective space $\mathbb{P}^{n-1} (\mathbb{F}_q)$), respectively. A matrix vertex $\langle M\rangle$ and a point vertex $\langle v\rangle$ are adjacent if and only if $v$ is an eigenvector of $M$. We determine several structural parameters of $\mathbf{SIG}(\mathbb{V}_0)$, including its twin classes, connectivity, domination number, diameter, vertex degrees, and number of edges. We show that every automorphism of $\mathbf{SIG}(\mathbb{V}_0)$ preserves the two parts of the bipartition. We prove that the kernel of the induced action of $Aut(\mathbf{SIG}(\mathbb V_0))$ on the projective part $\mathbb{P}^{n-1} (\mathbb{F}_q)$ is precisely $\prod_{\mathcal C\in\mathcal T} S_{\mathcal C}$, where $\mathcal T$ denotes the set of twin classes of matrix vertices and $S_{\mathcal{C}}$ is the symmetric group on $\mathcal{C}$. We then determine the full automorphism group of $\mathbf{SIG}(\mathbb{V}_0)$. For $n\geq3$, we prove that $Aut(\mathbf{SIG}(\mathbb V_0)) \cong \left(\prod_{\mathcal C\in\mathcal T} S_{\mathcal C}\right) \rtimes P\Gamma L_n(q)$. For $n=2$, we obtain $Aut(\mathbf{SIG}(\mathbb V_0)) \cong \left( \prod_{i=1}^{q+1}S_q\times \prod_{i=1}^{\frac{q(q+1)}{2}}S_q \right) \rtimes S_{q+1}.$

Explore related subjects

Keep this discovery

BibTeXRIS

Ali Majidinya. 2026-07-28. The Automorphism Group of the Spectral Incidence Graph over Finite Fields. https://arxiv.org/abs/2607.26320

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA