Linearization of polynomials in prime characteristic, with applications to the Golay code and Steiner system

TL;DR

This paper investigates the minimal degree of $q$-polynomials divisible by a given polynomial over fields containing a finite field, relating it to Galois group representations, and applies findings to construct the Golay code and Steiner system.

Contribution

It introduces a new approach to determine the minimal degree of $q$-polynomials divisible by a polynomial, linking it to Galois theory, and applies this to construct important combinatorial objects.

Findings

Established a relation between $q$-polynomials and Galois group representations.

Provided a method to construct the Golay code and Steiner system using polynomial linearization.

Determined the minimal degree of $q$-polynomials divisible by a given polynomial.

Abstract

Let $F$ be any field containing the finite field of order $q$. A $q$-polynomial $L$ over $F$ is an element of the polynomial ring $F[x]$ with the property that all powers of $x$ that appear in $L$ with nonzero coefficient have exponent a power of $q$. It is well known that given any ordinary polynomial $f$ in $F[x]$, there exists a $q$-polynomial that is divisible by $f$. We study the smallest degree of such a $q$-polynomial. This is equivalent to studying the $\mathbb{F}_q$-span of the roots of $f$ in a splitting field. We relate this quantity to the representation theory of the Galois group of $f$. As an application we give a simultaneous construction of the binary Golay code of length 24, and the Steiner system on 24 points.