2025/05/17 by Simion Breaz, Breaz, Simion
Computer Science · Mathematics · #Cardinality (data modeling) #Coding theory and cryptography #Field (mathematics) #Finite Group Theory Research #Finite field #Finite set #Integer (computer science) #Matrix (chemical analysis) #Tensor decomposition and applications
paper · pdf · doi:10.48550/arxiv.2505.11805
openalex publication_date 2025/05/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
We prove that if k is a positive integer, then for every finite field \mathbbFq of cardinality q≠ 2 and for every positive integer n such that qn>(k-1)4, every n× n matrix over \mathbbFq can be expressed as a sum of two k-th powers.