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 Fp[A1,…,At] with A1,…,At ∈ GL(n,Fp) is a finite field, performing at most O(tn6(p)) elementary operations in Fp. In the affirmative case, the algorithm returns a defining element a so that Fp[A1,…,At] = Fp[a]. We then study an invariant for the extended-affine equivalence of Dembowski-Ostrom (DO) polynomials. More precisely, for a DO polynomial g ∈ Fpn[x], we associate to g a set of n × n matrices with coefficients in Fp, denoted Quot(Dg), 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, Quot(Dg) is the set of quotients XY-1 with Y ≠ 0,X being elements from the spread set of the corresponding commutative presemifield, and Quot(Dg) forms a field of order pn if and only if g is equivalent to the planar monomial x2, 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 Quot(Dg) 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 ∈ Quot(Dg) generates a field Fp[X] ⊂eq Quot(Dg) and Quot(Dg) contains the field Fpn.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…