SearcharxivSearch

arXiv · 2211.17103

On Matrix Algebras Isomorphic to Finite Fields and Planar Dembowski-Ostrom Monomials

Abstract

Let $p$ be a prime and $n$ a positive integer. As the first main result, we present a deterministic algorithm for deciding whether the matrix algebra $\mathbb{F}_p[A_1,\dots,A_t]$ with $A_1,\dots,A_t \in \mathrm{GL}(n,\mathbb{F}_p)$ is a finite field, performing at most $\mathcal{O}(tn^6\log(p))$ elementary operations in $\mathbb{F}_p$. In the affirmative case, the algorithm returns a defining element $a$ so that $\mathbb{F}_p[A_1,\dots,A_t] = \mathbb{F}_p[a]$. We then study an invariant for the extended-affine equivalence of Dembowski-Ostrom (DO) polynomials. More precisely, for a DO polynomial $g \in \mathbb{F}_{p^n}[x]$, we associate to $g$ a set of $n \times n$ matrices with coefficients in $\mathbb{F}_p$, denoted $\mathrm{Quot}(\mathcal{D}_g)$, that stays invariant up to matrix similarity when applying extended-affine equivalence transformations to $g$. In the case where $g$ is a planar DO polynomial, $\mathrm{Quot}(\mathcal{D}_g)$ is the set of quotients $XY^{-1}$ with $Y \neq 0,X$ being elements from the spread set of the corresponding commutative presemifield, and $\mathrm{Quot}(\mathcal{D}_g)$ forms a field of order $p^n$ if and only if $g$ is equivalent to the planar monomial $x^2$, i.e., if and only if the commutative presemifield associated to $g$ is isotopic to a finite field. As the second main result, we analyze the structure of $\mathrm{Quot}(\mathcal{D}_g)$ for all planar DO monomials, i.e., for commutative presemifields of odd order being isotopic to a finite field or a commutative twisted field. More precisely, for $g$ being equivalent to a planar DO monomial, we show that every non-zero element $X \in \mathrm{Quot}(\mathcal{D}_g)$ generates a field $\mathbb{F}_p[X] \subseteq \mathrm{Quot}(\mathcal{D}_g)$ and $\mathrm{Quot}(\mathcal{D}_g)$ contains the field $\mathbb{F}_{p^n}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Christof Beierle, Patrick Felke. 2022-11-17. On Matrix Algebras Isomorphic to Finite Fields and Planar Dembowski-Ostrom Monomials. https://doi.org/10.1016/j.ffa.2025.102590

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