English
Related papers

Related papers: An effective estimate for the sum of two cubes pro…

200 papers

Let $m\ge3$ be an integer. The polygonal numbers of order $m+2$ are given by $p_{m+2}(n)=m\binom n2+n$ $(n=0,1,2,\ldots)$. A famous claim of Fermat proved by Cauchy asserts that each nonnegative integer is the sum of $m+2$ polygonal numbers…

Number Theory · Mathematics 2017-10-06 Xiang-Zi Meng , Zhi-Wei Sun

We demonstrate that $$\|\mu\|_{U^3([N])} \ll_{A}^{\text{ineff}} \log^{-A}(N)$$ $$\|\Lambda - \Lambda_Q\|_{U^3([N])} \ll_{A}^{\text{ineff}} \log^{-A}(N)$$ for any $A > 0$ where $\Lambda_Q$ is an approximant to the von Mangoldt function and…

Number Theory · Mathematics 2023-03-22 James Leng

We study the cubic fixed point for $N=3$ and $4$ by using finite size scaling applied to data obtained from Monte Carlo simulations of the $N$-component $\phi^4$ model on the simple cubic lattice. We generalize the idea of improved models…

Statistical Mechanics · Physics 2023-07-11 Martin Hasenbusch

In 1888, Hilbert proved that every nonnegative quartic form $f=f(x,y,z)$ with real coefficients is a sum of three squares of quadratic forms. His proof was ahead of its time and used advanced methods from topology and algebraic geometry. In…

Algebraic Geometry · Mathematics 2024-12-23 Albrecht Pfister , Claus Scheiderer

We prove a new q-analogue of Nicomachus's Theorem about the sum of cubes and some related results.

Combinatorics · Mathematics 2014-04-04 Johann Cigler

We introduce a general class $F_0$ of additive functions $f$ such that $f(p) = 1$ and prove a tight bound for exponential sums of the form $\sum_{n \le x} f(n) e(\alpha n)$ where $f \in F_0$ and $e(\theta) = \exp(2\pi i \theta)$. Both…

Number Theory · Mathematics 2026-02-13 Ayla Gafni , Nicolas Robles

Let $m,n\in \Bbb{N}$. We represent the additive subgroups of the ring $\Bbb{Z}_m \times \Bbb{Z}_n$, which are also (unital) subrings, and deduce explicit formulas for $N^{(s)}(m,n)$ and $N^{(us)}(m,n)$, denoting the number of subrings of…

Number Theory · Mathematics 2019-10-25 László Tóth

For $0<\alpha\leq1$ and $\lambda>0,$ let \begin{equation}\label{1} G_{\lambda,\alpha}=\left\{f\in\mathcal{A}:\left|\dfrac{1-\alpha+\alpha zf''(z)/f'(z)}{zf'(z)/f(z)}-(1-\alpha)\right|<\lambda, z\in\mathbb{D}\right\}, \end{equation} the…

Complex Variables · Mathematics 2022-03-23 S. Sivaprasad Kumar , Priyanka Goel

Hardy and Littlewood conjectured that every sufficiently large integer is either a square or the sum of a prime and a square. Let $E(x)$ be the number of positive integers up to $x\ge4$ which does not satisfy this condition. We prove…

Number Theory · Mathematics 2015-04-21 Yuta Suzuki

We investigate when the exponential sum $S_f(x,\alpha) := \sum_{n\le x}f(n)\mathrm{e}(n\alpha)$ is bounded, for a multiplicative function $f$ and $\alpha\in\mathbb{R}$. We show that under natural assumptions, $S_f(x,\alpha)$ is bounded only…

Number Theory · Mathematics 2026-02-24 Pierre-Alexandre Bazin , Ihor Pylaiev , Fred Tyrrell

Let $\phi(\cdot)$ and $\sigma(\cdot)$ denote the Euler function and the sum of divisors function, respectively. In this paper, we give a lower bound for the number of positive integers $m\le x$ for which the equation $m=n-\phi(n)$ has no…

Number Theory · Mathematics 2007-05-23 William D. Banks , Florian Luca

We show how to effectively solve 5-term $S$-unit equations when the set of primes $S$ has cardinality at most 3, and use this to provide an explicit answer to an old question of D.J. Newman on representations of integers as sums of…

Number Theory · Mathematics 2023-08-11 Prajeet Bajpai , Michael A. Bennett

We compare three notions of effectiveness on uncountable structures. The first notion is that of a $\real$-computable structure, based on a model of computation proposed by Blum, Shub, and Smale, which uses full-precision real arithmetic.…

Logic · Mathematics 2008-09-01 Wesley Calvert

We investigate the number of representations of a large positive integer as the sum of two squares, two positive integral cubes, and two sixth powers, showing that the anticipated asymptotic formula fails for at most O((log X)^3) positive…

Number Theory · Mathematics 2022-01-11 Trevor D. Wooley

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…

Number Theory · Mathematics 2017-09-20 Markus Hittmeir

We investigate the asymptotic formula for the number of representations of a large positive integer as a sum of $k$-th powers of integers represented as the sums of three positive cubes, counted with multiplicities. We also obtain a lower…

Number Theory · Mathematics 2020-12-17 Javier Pliego

We prove that when $f$ is a Rademacher random multiplicative function for any $\epsilon>0$, then $\sum_{n \leqslant x}\frac{f(n)}{\sqrt{n}} \ll (\log\log(x))^{3/4+\epsilon}$ for almost all $f$. We also show that there exist arbitrarily…

Number Theory · Mathematics 2026-02-04 Christopher Atherfold

We consider a sequence $\{f(p)\}_{p\ {\rm prime}}$ of independent random variables taking values $\pm 1$ with probability $1/2$, and extend $f$ to a multiplicative arithmetic function defined on the squarefree integers. We investigate upper…

Number Theory · Mathematics 2017-12-07 Joseph Basquin

We consider the problem \[ -\Delta u=|u|^{p-2}u in \Omega, u=0 on \partial\Omega, \] where $\Omega:=\{(y,z)\in\mathbb{R}^{m+1}\times\mathbb{R}^{N-m-1}: 0<a<|y|<b<\infty\}$, $0\leq m\leq N-1$ and $N\geq2$. Let…

Analysis of PDEs · Mathematics 2013-04-09 Mónica Clapp , Andrzej Szulkin

Let $q, m\geq 2$ be integers with $(m,q-1)=1$. Denote by $s_q(n)$ the sum of digits of $n$ in the $q$-ary digital expansion. Further let $p(x)\in mathbb{Z}[x]$ be a polynomial of degree $h\geq 3$ with $p(\mathbb{N})\subset \mathbb{N}$. We…

Number Theory · Mathematics 2011-10-24 Thomas Stoll