Matrix Waring Problem
Abstract
We prove that for all integers k ≥ 1, there exists a constant Ck depending only on k, such that for all q > Ck, and for n = 1, 2 every matrix in Mn(Fq) is a sum of two kth powers and for all n ≥ 3 every matrix in Mn(Fq) is a sum of at most three kth powers.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.