Related papers: On gaps between sums of four fourth powers

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…

We improve a result of Solymosi on sum-products in R, namely, we prove that max{|A+A|,|AA|}\gg |A|^{4/3+c}, where c>0 is an absolute constant. New lower bounds for sums of sets with small product set are found. Previous results are improved…

We prove that the equation ${ (x - y)^4 + x^4 + (x + y)^4 = z^n }$ has no integer solutions ${ x, y, z}$ with ${ \gcd(x, y) = 1 }$ for all integers ${ n > 1 }$. We mainly use a modular approach with two Frey ${ \mathbb{Q} }$-curves defined…

We obtain an estimate for the cubic Weyl sum which improves the bound obtained from Weyl differencing for short ranges of summation. In particular, we show that for any $\varepsilon>0$ there exists some $\delta>0$ such that for any coprime…

Nualart & Pecatti ([Nualart and Peccati, 2005, Thm 1]) established the first fourth-moment theorem for random variables in a fixed Wiener chaos, i.e. they showed that convergence of the sequence of fourth moments to the fourth moment of the…

It is well known that when a prime $p$ is congruent to 1 modulo 4, the sum of the quadratic residues equals the sum of the quadratic nonresidues. In this note we give analogous results for the case where $p$ is congruent to 3 modulo 4.

Let $a,b\in \mathbb{N}$ be fixed and coprime such that $a>b$, and let $N$ be any number of the form $a^n\pm b^n$, $n\in\mathbb{N}$. We will generalize a result of Bostan, Gaudry and Schost and prove that we may compute the prime…

In this paper, we construct explicit exponential bases on finite or infinite unions of segments of total length one with some conditions on gaps between them. We also construct exponential bases on certain unions of cubes in $\R^d$ and we…

The power graph $\Gamma_G$ of a finite group $G$ is the graph with the vertex set $G$, where two distinct elements are adjacent if one is a power of the other. An $L(2, 1)$-labeling of a graph $\Gamma$ is an assignment of labels from…

In this paper, we prove some results of restricted sums of four squares using arithmetic of quaternions in the ring of Lipschitz integers. For example, we show that every nonnegative integer $n$ can be written as $x^{2}+y^{2}+z^{2}+t^{2}$…

Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$…

Let n>=3 be an odd integer. For any integer a prime to n, define the permutation gamma_{a,n} of {1,...,(n-1)/2} by gamma_{a,n}(x)=n-\dec{ax}_n if {ax}_n>=(n+1)/2, and {ax}_n if {ax}_n<=(n-1)/2, where {x}_n denotes the least nonnegative…

Suppose a positive integer $n$ is written as a sum of squares of $m$ integers. What can one say about the value $T$ of the sum of these $m$ integers itself? Which $T$ can be obtained if one considers all possible representations of $n$ as a…

Let $Z(t)=\chi^{-1/2}(1/2+it)\zeta(1/2+it)=e^{i\theta(t)}\zeta(1/2+it)$ be Hardy's function and $g(n)$ be the $n$-th Gram points defined by $\theta(g(n))=\pi n$. Titchmarsh proved that $\sum_{n \leq N} Z(g(2n)) =2N+O(N^{3/4}\log^{3/4}N) $…

We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…

We present the Sudakov form factor in full color $\mathcal{N}=4$ supersymmetric Yang-Mills theory to four loop order and provide uniformly transcendental results for the relevant master integrals through to weight eight.

In this note, we show the existence of integer sequences of lengths at least 3 (except 7) such that for every integer in position $i\equiv 1\pmod{4}$ (respectively position $j\equiv 3\pmod{4}$), counting from left to right, the sum of the…

We prove that for all $n\geq 1$ there exists a number between $n^2$ and $(n+1)^2$ with at most 4 prime factors. This is the first result of this kind that holds for every $n\geq 1$ rather than just sufficiently large $n$. Our approach…

Let $s(n):= \sum_{d\mid n,~d<n} d$ denote the sum of the proper divisors of $n$. It is natural to conjecture that for each integer $k\ge 2$, the equivalence \[ \text{$n$ is $k$th powerfree} \Longleftrightarrow \text{$s(n)$ is $k$th…

We investigate the Waring-Goldbach problem of representing a positive integer $n$ as the sum of $s$ $k$th powers of almost equal prime numbers. Define $s_k=2k(k-1)$ when $k\ge 3$, and put $s_2=6$. In addition, put $\theta_2=\frac{19}{24}$,…