Related papers: Matrix Waring Problem

We prove that for all integers $k \geq 1$, there exists a constant $C_k$ depending only on $k$ such that for all $q > C_k$ and for all $n \geq 1$ every matrix in $M_n(\mathbb F_q)$ is a sum of two $k$th powers.

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…

We prove that for all integers $k \geq 1$, $q\ge (k-1)^4+ 6k$, and $m \geq 1$, every matrix in $ M_m(\mathbb F_q)$ is a sum of two kth powers: $M_m(\mathbb F_q)=\{A^k+B^k|A,B\in M_m(\mathbb F_q)\}$. We further generalize and refine this…

We prove that if $k$ is a positive integer then for every finite field $\mathbb{F}$ of cardinality $q\neq 2$ and for every positive integer $n$ such that $q^n>(k-1)^4$, every $n\times n$ matrix over $\mathbb{F}$ can be expressed as a sum of…

In this paper we give necessary and sufficient trace conditions for an n by n matrix over any commutative and associative ring with unity to be a sum of k-th powers of matrices over that ring, where n,k are integers greater equal 2. We…

If a noncommutative polynomial $f$ is neither an identity nor a central polynomial of $\mathcal A=M_n(\C)$, then every trace zero matrix in $\mathcal A$ can be written as a sum of two matrices from $f(\mathcal A)-f(\mathcal A)$. Moreover,…

We study a variant of Waring's problem for $\mathbb{Z}_n$, the ring of integers modulo $n$: For a fixed integer $k \geq 2$, what is the minimum number $m$ of $k$th powers necessary such that $x \equiv x_1^k + \dots + x_m^k \pmod{n}$ has a…

Let $r$ be a nonconstant noncommutative rational function in $m$ variables over an algebraically closed field $K$ of characteristic 0. We show that for $n$ large enough, there exists an $X\in M_n(K)^m$ such that $r(X)$ has $n$ distinct and…

Let $f\in \mathbb{Q}(x)$ be a non-constant rational function. We consider "Waring's Problem for $f(x)$," i.e., whether every element of $\bbq$ can be written as a bounded sum of elements of $\{f(a)\mid a\in \mathbb{Q}\}$. For rational…

A natural number is a binary $k$'th power if its binary representation consists of $k$ consecutive identical blocks. We prove an analogue of Waring's theorem for sums of binary $k$'th powers. More precisely, we show that for each integer $k…

Let $\mu_1, \ldots, \mu_s$ be real numbers, with $\mu_1$ irrational. We investigate sums of shifted $k$th powers $\mathfrak{F}(x_1, \ldots, x_s) = (x_1 - \mu_1)^k + \ldots + (x_s - \mu_s)^k$. For $k \ge 4$, we bound the number of variables…

We give an upper bound for the minimum $s$ with the property that every sufficiently large integer can be represented as the sum of $s$ positive $k$-th powers of integers represented as the sum of three positive cubes for the cases $2\leq…

The purpose of this article is to show uniqueness theorems for meromorphic mappings of C^m to CP^n with few hyperplanes H_j, j=1,...,q. It is well known that uniqueness theorems hold for q \geq 3n+2. In this paper we show that for every…

We prove that all polynomials in several variables can be decomposed as the sums of $k$th powers: $P(x_1,...,x_n) = Q_1(x_1,...,x_n)^k+...+ Q_s(x_1,...,x_n)^k$, provided that elements of the base field are themselves sums of $k$th powers.…

On the Waring's problems for matrices over a commutative ring, there are some trace conditions provided for matrices eligibly expressed as a sum of $k$-th powers with $k=2,3,4,5,6,7,8$ in several literatures. In this paper, we provide the…

Let $G(k)$ denote the least number $s$ having the property that every sufficiently large natural number is the sum of at most $s$ positive integral $k$-th powers. Then for all $k\in \mathbb N$, one has \[ G(k)\le \lceil k(\log…

The set of forks is a class of quivers introduced by M. Warkentin, where every connected mutation-infinite quiver is mutation equivalent to infinitely many forks. Let $Q$ be a fork with $n$ vertices, and $\boldsymbol{w}$ be a…

Balogh and Bollob\'as [{\em Combinatorica 25, 2005}] prove that for any $k$ there is a constant $f(k)$ such that any set system with at least $f(k)$ sets reduces to a $k$-star, an $k$-costar or an $k$-chain. They proved $f(k)<(2k)^{2^k}$.…

Let $1\le k\le n$ and $M$ be a random $n\times n$ matrix with independent uniformly random $\{\pm 1\}$-entries. We show that there exists an absolute constant $c > 0$ such that \[\mathbf{P}[\operatorname{rank}(M)\le n-k]\le \exp(-c nk).\]

We investigate the existence of representations of every large positive integer as a sum of $k$-th powers of integers represented as certain diagonal forms. In particular, we consider a family of diagonal forms and discuss the problem of…