Related papers: Arithmetic progressions consisting of unlike power…

In two earlier papers, two of the present authors (A.G. and U.S.) extended Lai's [Ann. Probab. 2 (1974) 432--440] law of the single logarithm for delayed sums to a multiindex setting in which the edges of the $\mathbf{n}$th window grow like…

In 2013, Sun conjectured that the partition function $p(n)$ is never a perfect power for $n \geq 2$. Building on this, Merca, Ono, and Tsai recently observed that for any fixed integers $d \geq 0$ and $k \geq 2$, there appear to be only…

Let $m$ and $k \geq 2$ be positive integers. We show that polynomial $P = (1+x)^m(1+x^k)$ is strongly unimodal (frequently known as {\it log concave\/}) if and only if $m \geq k^2 -3$; this is also the criterion for $P$ to be merely…

Let I_{n,k} (resp. J_{n,k}) be the number of involutions (resp. fixed-point free involutions) of {1,...,n} with k descents. Motivated by Brenti's conjecture which states that the sequence I_{n,0}, I_{n,1},..., I_{n,n-1} is log-concave, we…

N=4 supersymmetric extensions of the l-conformal Galilei algebra are constructed by properly extending the Lie superalgebra associated with the most general N=4 superconformal group in one dimension D(2,1;a). If the acceleration generators…

In its usual form, Freiman's 3k-4 theorem states that if A and B are subsets of the integers of size k with small sumset (of size close to 2k) then they are very close to arithmetic progressions. Our aim in this paper is to strengthen this…

In this paper, we prove that there is no x>=4 such that the difference of x-th powers of two consecutive Fibonacci numbers greater than 0 is a Lucas number.

We show that if a finite, large enough subset A of an arbitrary abelian group satisfies the small doubling condition |A + A| < (log |A|)^{1 - epsilon} |A|, then A must contain a three-term arithmetic progression whose terms are not all…

We prove that if $A\subset \{1,\dots,N\}$ has no nontrivial three-term arithmetic progressions, then $|A|\leq \exp(-c\log(N)^{1/6}\log\log(N)^{-1})N$ for some absolute constant $c>0$. To obtain this bound, we use an iterated variant of the…

We improve the lower bound on the number of permutations of {1,2,...,n} in which no 3-term arithmetic progression occurs as a subsequence, and derive lower bounds on the upper and lower densities of subsets of the positive integers that can…

Let $a\geq 1, b\geq 0$ and $k\geq 2$ be any given integers. It has been proven that there exist infinitely many natural numbers $m$ such that sum of divisors of $m$ is a perfect $k$th power. We try to generalize this result when the values…

The goal of this paper is to count the number of distinct functions of n variables, up to permutation of the variables, that can be constructed using each variable exactly once, without constants, using only the operations of addition,…

This is the first of two coupled papers estimating the mean values of multiplicative functions, of unknown support, on arithmetic progressions with large differences. Applications are made to the study of primes in arithmetic progression…

We show that smooth-supported multiplicative functions $f$ are well-distributed in arithmetic progressions $a_1a_2^{-1} \pmod q$ on average over moduli $q\leq x^{3/5-\varepsilon}$ with $(q,a_1a_2)=1$.

We solve the enumeration of the set $\textrm{AP}(n)$ of partitions of a positive integer $n$ in which the nondecreasing sequence of parts forms an arithmetic progression. In particular, we establish a formula for the number of nondecreasing…

We show that if $A\subset \{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert \ll N/(\log N)^{1+c}$ for some absolute constant $c>0$. In particular, this proves the first non-trivial case of a…

We prove a generalisation of Roth's theorem for arithmetic progressions to d-configurations, which are sets of the form {n_i+n_j+a}_{1 \leq i \leq j \leq d} where a, n_1,..., n_d are nonnegative integers, using Roth's original density…

Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet $L$-functions is true, we then establish…

We develop new tools leading, for each integer $n\ge 4$, to a significantly improved upper bound for the uniform exponent of rational approximation $\widehat{\lambda}_n(\xi)$ to successive powers $1,\xi,\dots,\xi^n$ of a given real…

We formulate some refinements of Goldbach's conjectures based on heuristic arguments and numerical data. For instance, any even number greater than 4 is conjectured to be a sum of two primes with one prime being 3 mod 4. In general, for…