相关论文: Waring's problem in the natural numbers with binar…

We prove a sharp density theorem for quadratic Waring's problem over cyclic groups, when the number of variables is at least $5$. Also, we obtain some new improvements on the density version of the quadratic Waring--Goldbach problem over…

Problems in additive number theory related to sum and difference sets, more general binary linear forms, and representation functions of additive bases for the integers and nonnegative integers.

In this paper, we investigate exceptional sets in the Waring-Goldbach problem for unlike powers. For example, estimates are obtained for sufficiently large integers below a parameter subject to the necessary local conditions that do not…

We establish bounds on a finite separable extension of function fields in terms of the relative class number, thus reducing the problem of classifying extensions with a fixed relative class number to a finite computation. We also solve the…

We investigate the class of regular-ordered word equations. In such equations, each variable occurs at most once in each side and the order of the variables occurring in both sides is the preserved (the variables can be, however, separated…

A Waring decomposition of a polynomial is an expression of the polynomial as a sum of powers of linear forms, where the number of summands is minimal possible. We prove that any Waring decomposition of a monomial is obtained from a complete…

We survey Weber's class number problem and its variants in the spirit of arithmetic topology; we recollect some history, present a relation to certain units and generalized Pell's equation, and overview a study of the $p$-adic limits of…

We study the binary Goldbach problem with arithmetic weights attached to one of the variables.

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 reconsider the classical problem of representing a finite number of forms of degree d in n+1 variables as sums of powers of linear forms. We define a geometric construct called a `grove', which, in a number of cases allows us to…

The Waring Problem over polynomial rings asks for how to decompose an homogeneous polynomial of degree $d$ as a finite sum of $d^{th}$ powers of linear forms. First, we give a constructive method to obtain a real Waring decomposition of any…

Many NP-complete problems take integers as part of their input instances. These input integers are generally binarized, that is, provided in the form of the "binary" numeral representation, and the lengths of such binary forms are used as a…

We show that a class of divergence-form elliptic problems with quadratic growth in the gradient and non-coercive zero order terms are solvable, under essentially optimal hypotheses on the coefficients in the equation. In addition, we prove…

The generalized Waring problem asks exactly which positive integers cannot be expressed as the sum of $j$ positive $k$-th powers? Using computational techniques, this paper refines an approach introduced by Zenkin, establishes results for…

We apply a method of Davenport to improve several estimates for slim exceptional sets associated with the asymptotic formula in Waring's problem. In particular, we show that the anticipated asymptotic formula in Waring's problem for sums of…

We pursue the study of families of functions on the natural numbers, with emphasis here on the bounded families. The situation being more complicated than the unbounded case, we attack the problem by classifying the families according to…

When k > 1 and s is sufficiently large in terms of k, we derive an explicit multi-term asymptotic expansion for the number of representations of a large natural number as the sum of s positive integral k-th powers.

We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…

We describe a method for bounding the set of exceptional integers not represented by a given additive form in terms of the exceptional set corresponding to a subform. Illustrating our ideas with examples stemming from Waring's problem for…

In this paper, we study a density version of Waring's problem. We prove that a positive density subset of $k$th-powers forms an asymptotic additive basis of order $O(k^2)$ provided that the relative lower density of the set is greater than…