Symmetric Tensor Decompositions over Finite Fields
Abstract
We study the symmetric tensor rank of multiplication over finite field extensions using linearized polynomials. Via field trace, symmetric linearized polynomials are identified with symmetric bilinear forms and symmetric matrices, allowing symmetric tensor decompositions to be reformulated as spanning problems by rank-one symmetric linearized polynomials. We translate these spanning conditions into explicit linear systems over finite fields and use the Frobenius automorphism to obtain computationally effective criteria. As applications, we recover known values of the symmetric bilinear complexity for small extension degrees and obtain explicit symmetric decompositions for several parameters. We also introduce the symmetric tensor-rank of a symmetric rank-metric code and show that, for the natural one-dimensional Gabidulin code associated with finite field multiplication, this invariant coincides with the symmetric tensor rank of the multiplication map.
Cite
@article{arxiv.2605.12295,
title = {Symmetric Tensor Decompositions over Finite Fields},
author = {Giuseppe Cotardo and Ferdinando Zullo},
journal= {arXiv preprint arXiv:2605.12295},
year = {2026}
}