Matrix Waring Problem. II

Abstract

We prove that for all integers k >= 1, there exists a constant C-k depending only on k such that for all q > C-k and for all n >= 1 every matrix in M-n(F-q) is a sum of two kth powers.