SearcharxivSearch

arXiv · 2311.09598

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 $T_n(\mathbb{F}_q)$ consisting of upper triangular matrices over a finite field. We prove that for all integers $k, n \geq 1$, there exists a constant $\mathcal C(k, n)$, such that for all $q> \mathcal C(k,n)$, every matrix in $T_n(\mathbb{F}_q)$ is a sum of three $k$-th powers. Moreover, if $-1$ is $k$-th power in $\mathbb{F}_q$, then for all $q>\mathcal C(k,n)$, every matrix in $T_n(\mathbb{F}_q)$ 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.

Explore related subjects

Keep this discovery

BibTeXRIS

Rahul Kaushik, Anupam Singh. 2023-11-16. Waring Problem For Triangular Matrix Algebra. https://doi.org/10.1016/j.laa.2024.03.031

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR