Waring Problem For Triangular Matrix Algebra
Abstract
The Matrix Waring problem is if we can write every matrix as a sum of k-th powers. Here, we look at the same problem for triangular matrix algebra Tn(Fq) consisting of upper triangular matrices over a finite field. We prove that for all integers k, n ≥ 1, there exists a constant C(k, n), such that for all q> C(k,n), every matrix in Tn(Fq) is a sum of three k-th powers. Moreover, if -1 is k-th power in Fq, then for all q> C(k,n), every matrix in Tn(Fq) is a sum of two k-th powers. We make use of Lang-Weil estimates about the number of solutions of equations over finite fields to achieve the desired results.
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.