English
Related papers

Related papers: On gaps between sums of four fourth powers

200 papers

We give explicit bounds on sums of $d(n)^2$ and $d_4(n)$, where $d(n)$ is the number of divisors of $n$ and $d_4(n)$ is the number of ways of writing $n$ as a product of four numbers. In doing so we make a slight improvement on the upper…

Number Theory · Mathematics 2021-02-02 Michaela Cully-Hugill , Timothy Trudgian

In this paper, using combinatorial and analytic methods, we prove an exact calculating formula on the $2m$-th power mean value of the generalized quadratic Gauss sums for $m\geq 2$. This solves a conjecture of He and Zhang [`On the $2k$-th…

Number Theory · Mathematics 2015-02-26 Feng Liu , Quan-Hui Yang

We present the complete four-loop four-point amplitude in N=4 super-Yang-Mills theory, for a general gauge group and general D-dimensional covariant kinematics, and including all non-planar contributions. We use the method of maximal cuts…

High Energy Physics - Theory · Physics 2011-03-03 Z. Bern , J. J. M. Carrasco , L. J. Dixon , H. Johansson , R. Roiban

A \emph{magic square} is an $n \times n$ array of distinct positive integers whose sum along any row, column, or main diagonal is the same number. We compute the number of such squares for $n=4$, as a function of either the magic sum or an…

Combinatorics · Mathematics 2011-03-08 Matthias Beck , Andrew Van Herick

Let $p_n$ denote the $n$-th prime number, $\{q_n\}$ be a sequence of positive numbers and $x\in\mathbb{R}$. In this note we prove that the inequality $$q_n p_{n+1}^{x}-q_{n+1}p_{n}^{x}<p_{n}^{x}p_{n+1}^{x-1}, $$ holds for infinitely many…

Number Theory · Mathematics 2017-12-11 Douglas Azevedo , Tiago Reis

We prove that the number of unit distances among $n$ planar points is at most $1.94\cdot n^{4/3}$, improving on the previous best bound of $8n^{4/3}$. We also give better upper and lower bounds for several small values of $n$. We also prove…

Combinatorics · Mathematics 2021-12-16 Péter Ágoston , Dömötör Pálvölgyi

In this paper, by using the elliptic curves theory, we study the fourth power Diophantine equation ${ \sum_{i=1}^n a_ix_{i} ^4= \sum_{j=1}^na_j y_{j}^4 }$, where $a_i$ and $n\geq3$ are fixed arbitrary integers. We solve the equation for…

Number Theory · Mathematics 2017-01-11 Farzali Izadi , Mehdi Baghalagdam

Let $A$ be a finite multiset of powers of a positive integer $d>1$. We describe the structure of the set $\mathrm{span}(A)$ of all sums of submultisets of $A$, and in particular give a criterion of $\mathrm{span}(A)=\mathrm{span}(B)$ for…

Combinatorics · Mathematics 2022-10-04 Yizhou Guo

We prove the optimal upper bound sum || f ||_4^4 << q^{eps} where f runs over an orthonormal basis of Maass cusp forms of prime level q and bounded spectral parameter.

Number Theory · Mathematics 2011-10-24 Valentin Blomer

Lagrange's Four Squares Theorem states that any positive integer can be expressed as the sum of four integer squares. We investigate the analogous question over Quaternion rings, focusing on squares of elements of Quaternion rings with…

Number Theory · Mathematics 2017-04-10 Anna Cooke , Spencer Hamblen , Sam Whitfield

We prove versions of Goldbach conjectures for Gaussian primes in arbitrary sectors. Fix an interval $\omega \subset \mathbb{T}$. There is an integer $N_\omega $, so that every odd integer $n$ with $N(n)>N_\omega $ and $\text{dist}(…

Number Theory · Mathematics 2024-03-21 Christina Giannitsi , Ben Krause , Michael Lacey , Hamed Mousavi , Yaghoub Rahimi

Hardy showed that $\sum_{n \ioe x}\tau(n)-x(\log x +2\gamma -1)$ is not $o(x^{1/4})$. In this article, we prove that $\sum_{n \ioe x}\tau(n)(1-\frac{x}{n})-xP(\log x)=\frac{1}{4}+O \left( \frac{\log x}{x^{1/4}} \right)$, where $P$ is a…

Number Theory · Mathematics 2026-01-13 Olivier Bordellès , Florian Daval

Let $G(k)$ denote the least number $s$ having the property that every sufficiently large natural number is the sum of at most $s$ positive integral $k$-th powers. Then for all $k\in \mathbb N$, one has \[ G(k)\le \lceil k(\log…

Number Theory · Mathematics 2022-11-21 Joerg Bruedern , Trevor D. Wooley

We show that there exists an absolute constant $c > 0$, such that, for any finite set $A$ of quaternions, \[ \max\{|A+A, |AA| \} \gtrsim |A|^{4/3 + c}. \] This generalizes a sum-product bound for real numbers proved by Konyagin and…

Combinatorics · Mathematics 2021-11-11 Abdul Basit , Ben Lund

We clarify the relationship between different multiple polylogarithms in weight~4 by writing suitable linear combinations of a given type of iterated integral I_{n_1,...,n_d}(z_1,...,z_d), in depth d>1 and weight \sum_i n_i=4 in terms of…

Number Theory · Mathematics 2016-09-20 Herbert Gangl

We show that, for a constant-degree algebraic curve $\gamma$ in $\mathbb{R}^D$, every set of $n$ points on $\gamma$ spans at least $\Omega(n^{4/3})$ distinct distances, unless $\gamma$ is an {\it algebraic helix} (see Definition 1.1). This…

Metric Geometry · Mathematics 2020-09-16 Orit E. Raz

Let $\Gamma$ denote the modular group $SL(2,\Bbb Z)$ and $C_n(\Gamma)$ the number of congruence subgroups of $\Gamma$ of index at most $n$. We prove that $\lim\limits_{n\to \infty} \frac{\log C_n(\Gamma)}{(\log n)^2/\log\log n} =…

Group Theory · Mathematics 2007-05-23 D. Goldfeld , A. Lubotzky , L. Pyber

We improve a result of Bennett concerning certain sequences involving sums of powers of positive integers.

Classical Analysis and ODEs · Mathematics 2007-05-23 Peng Gao

A sequence $S$ is potentially $K_{m}-C_{4}$-graphical if it has a realization containing a $K_{m}-C_{4}$ as a subgraph. Let $\sigma(K_{m}-C_{4}, n)$ denote the smallest degree sum such that every $n$-term graphical sequence $S$ with…

Combinatorics · Mathematics 2007-08-30 Chunhui Lai

Let S be a subset of the unit disk, and let F(s) denote the class of completely multiplicative functions f such that f(p) is in S for all primes p. The authors' main concern is which numbers arise as mean-values of functions in F(s). More…

Number Theory · Mathematics 2016-09-07 Andrew Granville , K. Soundararajan
‹ Prev 1 4 5 6 7 8 10 Next ›