English
Related papers

Related papers: Matrix Waring Problem -- II

200 papers

Denote by P(K, k) the members of the field K which are sums of kth powers of field elements, by P+(K, k) the set of members of K which are sums of kth powers of totally positive elements of K. We are interested in deciding whether or not…

Number Theory · Mathematics 2013-03-21 William Ellison

We give a characterization of all pairs $(k,n)$ of positive integers for which the ratio $$ \frac{1^k-2^k+3^k-\dots+(-1)^{n+1} n^k}{1^k-2^k+3^k-\dots+(-1)^{n}(n-1)^k} $$ of two consecutive alternating power sums is an integer.

Number Theory · Mathematics 2019-07-16 Ioulia N. Baoulina

The Waring function $g(k,q)$ measures the difficulty of Waring's problem for $k$th powers in the field of $q$ elements. Its calculation seems to be difficult, and many partial results have been published, notably upper bounds for certain…

Number Theory · Mathematics 2008-10-03 Arne Winterhof , Christiaan van de Woestijne

In 1951, Linnik proved the existence of a constant $K$ such that every sufficiently large even number is the sum of two primes and at most $K$ powers of 2. Since then, this style of approximation has been considered for problems similar to…

Number Theory · Mathematics 2022-11-14 Shehzad Hathi

We show the existence of a constant $c > 0$ such that, for all positive integers $n$, there exist integers $1 \leq a_1 < \ldots < a_k \leq n$ such that there are at least $cn^2$ distinct integers of the form $\sum_{i=u}^{v}a_i$ with $1 \leq…

Combinatorics · Mathematics 2023-11-17 Adrian Beker

We establish that almost every positive integer $n$ is the sum of four cubes, two of which are at most $n^{\theta}$, as long as $\theta\geq192/869$. An asymptotic formula for the number of such representations is established when…

Number Theory · Mathematics 2010-06-29 Siu-lun Alan Lee

We show that for every positive integer $k$, any tournament can be partitioned into at most $2^{ck}$ $k$-th powers of paths. This result is tight up to the exponential constant. Moreover, we prove that for every $\varepsilon>0$ and every…

Combinatorics · Mathematics 2021-05-27 António Girão , Dániel Korándi , Alex Scott

For any integer $r\ge2$, define a sequence of numbers $\{c_k^{(r)}\}_{k=0}^\infty$, independent of the parameter $n$, by $$ \sum_{k=0}^n{\binom nk}^r{\binom{n+k}k}^r =\sum_{k=0}^n\binom nk\binom{n+k}kc_k^{(r)}, \qquad n=0,1,2,...c. $$ We…

Classical Analysis and ODEs · Mathematics 2007-05-23 Wadim Zudilin

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…

Combinatorics · Mathematics 2016-10-18 Jacob Sprittulla

Let E_n={x_i=1, x_i+x_j=x_k, x_i*x_j=x_k: i,j,k \in {1,...,n}}. We prove: (1) there is an algorithm that for every computable function f:N-->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any…

Logic · Mathematics 2013-12-03 Apoloniusz Tyszka

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

Number Theory · Mathematics 2012-04-10 Victor J. W. Guo , Jiang Zeng

Let $\mathcal{Q}$ be a quaternion division algebra over a field, and $n \geq 2$ be an integer. In a recent article, de La Cruz et al have proved that every $n$-by-$n$ matrix with entries in $\mathcal{Q}$ and pure quaternionic trace is the…

Rings and Algebras · Mathematics 2025-08-28 Clément de Seguins Pazzis

We prove that for any positive integer c there are at least N(c), $1\leq N(c) < \phi(c)/2$ representations of c as a sum of two positive integers a, b, with no common divisor, such that the N(c) radicals R(abc) are all greater than kc,…

Number Theory · Mathematics 2007-05-23 Constantin M. Petridi

In this note, we prove that for every two positive integers $m \geq n \geq 9$, there exist $n$ positive rational numbers whose product is 1 and sum is $m$.

Number Theory · Mathematics 2016-03-29 Jungin Lee

We show that the Waring's number over a finite field $\mathbb{F}_q$, denoted $g(k,q)$, when exists, coincides with the diameter of the generalized Paley graph $\Gamma(k,q)=Cay(\mathbb{F}_{q},R_k)$ with $R_k=\{x^k : x\in \mathbb{F}_q^*\}$.…

Number Theory · Mathematics 2021-01-06 Ricardo A. Podestá , Denis E. Videla

In this note we discuss an analog of the classical Waring problem for C[x_0, x_1,...,x_n]. Namely, we show that a general homogeneous polynomial p \in C[x_0,x_1,...,x_n] of degree divisible by k\ge 2 can be represented as a sum of at most…

Algebraic Geometry · Mathematics 2015-06-03 Ralf Fröberg , Giorgio Ottaviani , Boris Shapiro

The computational function of a matchgate is represented by its character matrix. In this article, we show that all nonsingular character matrices are closed under matrix inverse operation, so that for every $k$, the nonsingular character…

Computational Complexity · Computer Science 2008-02-21 Angsheng Li , Mingji Xia

Let $M_n(\mathbb{F})$ denote the algebra of $n \times n$ matrices over an algebraically closed field $\mathbb{F}$ of characteristic different from $2$. For $n \ge 2$, we classify all maps $\phi : M_n(\mathbb{F}) \to M_n(\mathbb{F})$…

Rings and Algebras · Mathematics 2025-12-16 Ilja Gogić , Mateo Tomašević

In arXiv:1603.03910 [math.NT] we introduced some $C_{n}$ in $Z/2[t]$ defined by a linear recurrence and showed that each $C_{n}$, $n\equiv 0 \bmod{4}$, is a sum of $C_{k}$, $k<n$. Combining this with results from arXiv:1508.07523 [math.NT]…

Number Theory · Mathematics 2016-12-07 Paul Monsky

We show that, for all positive integers $n_1, \ldots, n_m$, $n_{m+1}=n_1$, and any non-negative integers $j$ and $r$ with $j\leqslant m$, the expression $$ \frac{1}{[n_1]}{n_1+n_{m}\brack n_1}^{-1}…

Combinatorics · Mathematics 2017-08-01 Victor J. W. Guo , Su-Dan Wang