Related papers: Problems in additive number theory, I

The study of sums of finite sets of integers has mostly concentrated on sets with very small sumsets (Freiman's theorem and related work) and on sets with very large sumsets (Sidon sets and $B_h$-sets). This paper considers the full range…

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

The number theoretic analogue of a net in metric geometry suggests new problems and results in combinatorial and additive number theory. For example, for a fixed integer g > 1, the study of h-nets in the additive group of integers with…

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

We prove that several results in different areas of number theory such as the divergent series, summation of arithmetic functions, uniform distribution modulo one and summation over prime numbers which are currently considered to be…

In this work we state a Theorem on number theory and apply it to solve some ordinary and partial differential equations.

In this note we briefly survey and propose some open problems related to isoparametric theory.

The goal of this paper is to consider some relations between varieties of representations of groups and varieties of associative algebras. The main emphasis is put on the varieties of representations of groups induced by the varieties of…

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…

An MSTD set is a finite set of integers with more sums than differences. It is proved that, for infinitely many positive integers $k$, there are infinitely many affinely inequivalent MSTD sets of cardinality $k$. There are several related…

In this paper, we give a purely cohomological interpretation of the extension problem for associative algebras; that is the problem of extending an associative algebra by another associative algebra. We then give a similar interpretation of…

In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…

We prove some new theorems in additive number theory, using novel techniques from automata theory and formal languages. As an example of our method, we prove that every natural number > 25 is the sum of at most three natural numbers whose…

It is an open problem in additive number theory to compute and understand the full range of sumset sizes of finite sets of integers, that is, the set $\mathcal{R}_{\mathbf{Z}}(h,k)= \{|hA|:A \subseteq {\mathbf{Z}} \text{ and } |A|=k\}$ for…

This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…

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…

First we reprove two results in additive number theory due to Dombi and Chen & Wang, respectively, on the number of representations of n as the sum of two odious or evil numbers, using techniques from automata theory and logic. We also use…

Over 300 sequences and many unsolved problems and conjectures related to them are presented herein together with theorems corollaries, formulae, examples, mathematical criteria, etc. (about integer sequences, numbers, quotients, residues,…

We continue the study of the center problem for the ordinary differential equation $v'=\sum_{i=1}^{\infty}a_{i}(x)v^{i+1}$ started in our earlier papers. In this paper we present the highlights of the algebraic theory of centers.

We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…