Related papers: Waring's problem for pseudo-polynomials

For a polynomial ring over a commutative ring of positive characteristic, we define on the associated de Rham-Witt complex a set of functions, and show that they are pseudovaluations in the sense of Davis, Langer and Zink. To achieve it, we…

The problem of simultaneous decomposition of binary forms as sums of powers of linear forms is studied. For generic forms the minimal number of linear forms needed is found and the space parametrizing all the possible decompositions is…

Let $\mathcal{R}_k(n)$ be the number of representations of an integer $n$ as the sum of a prime and a $k$-th power. Define E_k(X) := |\{n \le X, n \in I_k, n\text{not a sum of a prime and a $k$-th power}\}|. Hardy and Littlewood conjectured…

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…

The aim of the present article is to explore the possibilities of representing positive integers as sums of other positive integers and highlight certain fundamental connections between their multiplicative and additive properties. In…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

We consider the set of the power non-negative polynomials of several variables and its subset that consists of polynomials which can be represented as a sum of squares. It is shown in the classic work by D.Hilbert that it is a proper…

A classical additive basis question is Waring's problem. It has been extended to integer polynomial and non-integer power sequences. In this paper, we will consider a wider class of functions, namely functions from a Hardy field, and show…

A positive integer k is a length of a polynomial if that polynomial factors into a product of k irreducible polynomials. We find the set of lengths of polynomials of the form x^n in R[x], where (R, m) is an Artinian local ring with m^2 = 0.

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…

The Sum of Square Roots (SSR) problem is the following computational problem: Given positive integers $a_1, \dots, a_k$, and signs $\delta_1, \dots, \delta_k \in \{-1, 1\}$, check if $\sum_{i=1}^k \delta_i \sqrt{a_i} > 0$. The problem is…

In this technical report, certain interesting classification of arithmetical functions is proposed. The notion of additively decomposable and multiplicatively decomposable arithmetical functions is proposed. The concepts of arithmetical…

Starting from our previous papers [AGMO] and [ABC], we prove the existence of a non-empty Euclidean open subset whose elements are polynomial vectors with 4 components, in 3 variables, degrees, respectively, 2,3,3,3 and rank 6, which are…

We give an estimate of exponential sums over singular binary quintic forms in a characteristic-free form, based on the Waring decomposition of binary forms. This extends the method on our preceding result on the space of binary quartics to…

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 $n = 1, 2$ every matrix in $M_n(\mathbb{F}_q)$ is a sum of two $k$th powers and for all $n \geq 3$ every…

Classification theorems for linear differential equations in two real variables, possessing eigenfunctions in the form of the polynomials (the generalized Bochner problem) are given. The main result is based on the consideration of the…

A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…

Pourchet proved in 1971 that every nonnegative univariate polynomial with rational coefficients is a sum of five or fewer squares. Nonetheless, there are no known algorithms for constructing such a decomposition. The sole purpose of the…

In this paper, we show combinatorial identities that represent powers of positive integers using multinomial coefficients, which do not come from the multinomial theorem and the multinomial Vandermonde's convolution.

We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…