← All problems

Larsen’s conjecture in the matrix Waring problem

For every positive integer kk, there exists a real constant CkC_k depending only on kk such that, for every positive integer nn and every prime power qq, if #Mn(Fq)=qn2>Ck\#M_n(\mathbb{F}_q)=q^{n^2}>C_k, then every matrix A∈Mn(Fq)A\in M_n(\mathbb{F}_q) can be written as A=Xk+YkA=X^k+Y^k for some X,Y∈Mn(Fq)X,Y\in M_n(\mathbb{F}_q).

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

A new unrefereed paper claims to prove the conjecture uniformly, but the claim has not been independently checked.

Larsen’s conjecture asks for a threshold depending only on kk such that every matrix over every finite field, once the matrix space is sufficiently large, is a sum of two kkth powers. The latest papers present this as a finite-field matrix analogue of Waring’s problem.

Known results

  • Earlier work, summarized in Matrix Waring Problem-II, gives two kkth powers for n=1,2n=1,2 and at most three kkth powers for n≥3n\ge 3.
  • In the coprime case, prior work gives a threshold Ck=k3−3k2+3kC_k=k^3-3k^2+3k.
  • Breaz (2025) proves a three-power result when qn>(k−1)4q^n>(k-1)^4 and Fq≠F2\mathbb{F}_q\ne\mathbb{F}_2.
  • Breaz (2025) proves the two-power conclusion when n≥7n\ge 7 and k<qk<q.

October 13, 2026 claimed resolution

On October 13, 2026, Krishna Kishore and Sunil Kumar Mallick’s preprint Matrix Waring Problem-III claimed that, for every kk, a constant CkC_k depending only on kk satisfies: if #Mn(Fq)>Ck\#M_n(\mathbb{F}_q)>C_k, every matrix is a sum of two kkth powers. The claim is unrefereed and has no independent verification in the retrieved record.

Current status (as of October 2026): The conjecture is claimed solved by an unrefereed preprint, but the proof remains unverified.

Sources

Solutions 0

No solutions have been posted yet.