2021/11/23 by Kishore, Krishna · 1 citation
#11G25 #11P05 #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT)
paper · doi:10.48550/arxiv.2111.11774
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(\mathbbFq) is a sum of two kth powers and for all n ≥ 3 every matrix in Mn(\mathbbFq) is a sum of at most three kth powers.