Related papers: Additive number theory and the Dyson transform

Let $\mathcal{A}\subset\mathbb{R}_{\geqslant1}$ be a countable set such that $\limsup_{x\to\infty}\frac{1}{\log x}\sum_{\alpha\in\mathcal{A}\cap[1,x]}\frac{1}{\alpha}>0$. We prove that, for every $\varepsilon>0$, there exist infinitely many…

Abstract upper densities are monotone and subadditive functions from the power set of positive integers into the unit real interval that generalize the upper densities used in number theory, including the upper asymptotic density, the upper…

In 1955 Kadison \cite{14} asked whether the analogue of the classical Burnside's theorem of the Linear Algebra holds in the infinite dimensional case. We use reproducing kernels method to solve the Kadison question. Namely, we prove that…

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.

We develop the theory of the additive dimension ${\rm dim} (A)$, i.e. the size of a maximal dissociated subset of a set $A$. It was shown that the additive dimension is closely connected with the growth of higher sumsets $nA$ of our set…

Let $\alpha$ and $\beta$ be real numbers such that $1$, $\alpha$ and $\beta$ are linearly independent over $\mathbb{Q}$. A classical result of Dirichlet asserts that there are infinitely many triples of integers $(x_0,x_1,x_2)$ such that…

The first work of Dyson relating to random matrix theory, "The dynamics of a disordered linear chain", is reviewed. Contained in this work is an exact solution of a so-called Type I chain in the case of the disorder variables being given by…

A famous theorem of Szemer\'edi asserts that given any density $0 < \delta \leq 1$ and any integer $k \geq 3$, any set of integers with density $\delta$ will contain infinitely many proper arithmetic progressions of length $k$. For general…

Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…

The notion of density of a finite set is introduced. We prove a general theorem of set theory which refines the Gibbs, Bose--Einstein, and Pareto distributions as well as the Zipf law.

A nonlinear version of Roth's theorem states that dense sets of integers contain configurations of the form $x$, $x+d$, $x+d^2$. We obtain a multidimensional version of this result, which can be regarded as a first step towards…

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

Many fundamental questions in additive number theory (such as Goldbach's conjecture, Fermat's last theorem, and the Twin Primes conjecture) can be expressed in the language of sum and difference sets. As a typical pair of elements…

A well known result of Newman says that upto a limit, multiples of $3$ with even number of 1's in binary representation always exceed multiples of $3$ with odd number of 1's. The phenomenon of preponderance of even number of 1's is now…

The seminal work of Kurzweil (1955) provides for any fixed badly approximable $\alpha$ and monotonically decreasing $\psi$ a Khintchine-type statement on the set of the inhomogeneous real parameters $\gamma$ for which $\lVert n \alpha +…

A More Sums Than Differences (MSTD, or sum-dominant) set is a finite set $A\subset \mathbb{Z}$ such that $|A+A|<|A-A|$. Though it was believed that the percentage of subsets of $\{0,...,n\}$ that are sum-dominant tends to zero, in 2006…

In 1915, Ramanujan proved asymptotic inequalities for the sum of divisors function, assuming the Riemann hypothesis (RH). We consider a strong version of Ramanujan's theorem and define highest abundant numbers that are extreme with respect…

Let $r(k,A,n)$ denote the number of representations of $n$ as a sum of $k$ elements of a set $A \subseteq \mathbb{N}$. In 2002, Dombi conjectured that if $A$ is co-infinite, then the sequence $(r(k,A,n))_{n \geq 0}$ cannot be strictly…

This article covers three topics. (1) It establishes links between the density of certain subsets of the set of primes and related subsets of the set of natural numbers. (2) It extends previous results on a conjecture of Bruinier and Kohnen…

For a nonempty finite set $A$ of integers, let $S(A) = \left\{ \sum_{b\in B} b: \emptyset \not= B\subseteq A\right\}$ be the set of all nonempty subset sums of $A$. In 1995, Nathanson determined the minimum cardinality of $S(A)$ in terms of…