English
Related papers

Related papers: On Waring's problem: beyond Freiman's theorem

200 papers

A result of Wright from 1937 shows that there are arbitrarily large natural numbers which cannot be represented as sums of $s$ $k$th powers of natural numbers which are constrained to lie within a narrow region. We show that the analogue of…

Number Theory · Mathematics 2018-11-05 Kirsti Biggs

Let $\mathbf{S}$ be the set of all finite or infinite increasing sequences of positive integers. For a sequence $S=\{s(n)\}, n\geq1,$ from $\mathbf{S},$ let us call a positive number $N$ an exponentially $S$-number $(N\in E(S)),$ if all…

Number Theory · Mathematics 2016-01-21 Vladimir Shevelev

The main result of this paper is the following: for all $b \in \mathbb Z$ there exists $k=k(b)$ such that \[ \max \{ |A^{(k)}|, |(A+u)^{(k)}| \} \geq |A|^b, \] for any finite $A \subset \mathbb Q$ and any non-zero $u \in \mathbb Q$. Here,…

Number Theory · Mathematics 2020-09-22 Brandon Hanson , Oliver Roche-Newton , Dmitrii Zhelezov

We show that a finite set of integers $A \subseteq \mathbb{Z}$ with $|A+A| \le K |A|$ contains a large piece $X \subseteq A$ with Fre\u{i}man dimension $O(\log K)$, where large means $|A|/|X| \ll \exp(O(\log^2 K))$. This can be thought of…

Combinatorics · Mathematics 2016-06-06 Freddie Manners

We study the average number of representations of an integer $n$ as $n = \phi(n_{1}) + \dots + \phi(n_{j})$, for polynomials $\phi \in \mathbb{Z}[n]$ with $\partial\phi = k\ge 1$, $\operatorname{lead}(\phi) = 1$, $j \ge k$, where $n_{i}$ is…

Number Theory · Mathematics 2026-05-14 Alessandra Migliaccio , Alessandro Zaccagnini

Let $k\ge 2$ be an integer and let $A$ be a set of nonnegative integers. The representation function $R_{A,k}(n)$ for the set $A$ is the number of representations of a nonnegative integer $n$ as the sum of $k$ terms from $A$. Let $A(n)$…

Number Theory · Mathematics 2023-03-03 Sándor Z. Kiss , Csaba Sándor , Quan-Hui Yang

We prove that assuming the Generalized Riemann Hypothesis every even integer larger than $\exp(\exp(15.85))$ can be written as the sum of a prime number and a number that has at most two prime factors.

Number Theory · Mathematics 2022-11-17 Matteo Bordignon , Valeriia Starichkova

It is well known that if S is a subset of the integers mod p, and if the second-largest Fourier coefficient is ``small'' relative to the largest coefficient, then the sumset S+S is much larger than S. We show in the present paper that if…

Combinatorics · Mathematics 2007-11-28 Ernie Croot , Tomasz Schoen

We study the representations of large integers $n$ as sums $p_1^2 + ... + p_s^2$, where $p_1,..., p_s$ are primes with $| p_i - (n/s)^{1/2} | \le n^{\theta/2}$, for some fixed $\theta < 1$. When $s = 5$ we use a sieve method to show that…

Number Theory · Mathematics 2012-01-27 Angel Kumchev , Taiyu Li

In 1851 Prouhet showed that when $N=j^{k+1}$ where $j$ and $k$ are positive integers, $j \geq 2$, the first $N$ consecutive positive integers can be separated into $j$ sets, each set containing $j^k$ integers, such that the sum of the…

Number Theory · Mathematics 2019-08-30 Ajai Choudhry

Let $\mathcal S^2$ be the Stepanov space and let $ \lambda_n\uparrow\infty$. Let $(a_n)_{n\ge 1}$ be satisfying Wiener's condition $A:= \sum_{n\ge 1} \big(\sum_{k\, :\, n\le \lambda_k \le n+1}|a_k|\big)^2 <\infty$. We prove that $\big\|…

Classical Analysis and ODEs · Mathematics 2018-03-16 Christophe Cuny , Michel Weber

The basic theme of this paper is the fact that if $A$ is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erd\H os-Szemer\'edi [E-S]. (see also…

Combinatorics · Mathematics 2007-05-23 Mei-Chu Chang

An integer $k$ is called regular (mod $n$) if there exists an integer $x$ such that $k^2x\equiv k$ (mod $n$). This holds true if and only if $k$ possesses a weak order (mod $n$), i.e., there is an integer $m\ge 1$ such that $k^{m+1} \equiv…

Number Theory · Mathematics 2015-05-14 Brăduţ Apostol , László Tóth

Let $s(n)$ be the number of different remainders $n \bmod k$, where $1 \leq k \leq \lfloor n/2 \rfloor$. This rather natural sequence is sequence A283190 in the OEIS and while some basic facts are known, it seems that surprisingly it has…

Number Theory · Mathematics 2025-08-29 Omkar Baraskar , Ingrid Vukusic

Recently, Grynkiewicz et al. [{\it Israel J. Math.} {\bf 193} (2013), 359--398], using tools from additive combinatorics and group theory, proved necessary and sufficient conditions under which the linear congruence $a_1x_1+\cdots…

Discrete Mathematics · Computer Science 2020-10-13 Khodakhast Bibak , Bruce M. Kapron , Venkatesh Srinivasan

Let $\sigma(n)$ denote the sum of the positive divisors of $n$. We prove that for any positive integer $k$, there is a number $m$ for which the equation $\sigma(x)=m$ has exactly $k$ solutions, settling a conjecture of Sierpi\'nski from…

Number Theory · Mathematics 2019-10-21 Kevin Ford , Sergei Konyagin

Let $s_1, s_2, \ldots$ be the sequence of positive integers, arranged in increasing order, that are representable by any binary quadratic form of fixed discriminant $D$. We show that \[ \limsup_{n \rightarrow \infty} \frac{s_{n+1}-s_n}{\log…

Number Theory · Mathematics 2022-05-02 Rainer Dietmann , Christian Elsholtz

Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…

Number Theory · Mathematics 2021-07-12 Asif Zaman

Let $I$ and $J$ be two intervals, and let $f, g: I \rightarrow \mathbb{R}$. If for any points $a$ and $b$ in $I$ and any positive numbers $p$ and $q$ such that $p + q = 1$, we have \begin{align} \nonumber p f(a) + q f(b) + g(pa + qb) \in J,…

General Mathematics · Mathematics 2023-01-13 Jun Liu

For a fixed positive integer n, let S_n denote the symmetric group of n! permutations on n symbols, and let maj(sigma) denote the major index of a permutation sigma. For positive integers k<m not greater than n and non-negative integers i…

Combinatorics · Mathematics 2007-05-23 Helene Barcelo , Robert Maule , Sheila Sundaram