English
Related papers

Related papers: Almost sure upper bound for random multiplicative …

200 papers

We examine how closely a multiplicative function resembles an additive function. Given a multiplicative function $g$ and an additive function $f$, we examine the size of the quantity $E(f,g;x)=\# \{n\leq x:f(n)=g(n)\}$. We establish a lower…

Number Theory · Mathematics 2017-06-28 Theophilus Agama

We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in \mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some…

Number Theory · Mathematics 2026-03-09 Artyom Radomskii

An upper estimate for the Lempert function of any $C^{1+\epsilon}$-smooth bounded domain in $\Bbb C^n$ is found in terms of the boundary distance.

Complex Variables · Mathematics 2012-09-03 Nikolai Nikolov , Peter Pflug , Pascal J. Thomas

We prove some results concerning the distribution of primes on the Riemann hypothesis. First, we prove the explicit result that there exists a prime in the interval $(x-\frac{4}{\pi} \sqrt{x} \log x,x]$ for all $x \geq 2$; this improves a…

Number Theory · Mathematics 2014-05-22 Adrian Dudek

We provide very effective methods to convert both asymptotic and explicit numeric bounds on the prime counting function $\psi(x)$ to bounds of the same type on both $\theta(x)$ and $\pi(x)$. This follows up our previous work on $\psi(x)$ in…

Number Theory · Mathematics 2023-05-18 Andrew Fiori , Habiba Kadiri , Joshua Swidinsky

In this paper, we establish new bounds for classical prime-counting functions. All of our bounds are explicit and assume the Riemann Hypothesis. First, we prove that $|\psi(x) - x|$ and $|\vartheta(x) - x|$ are bounded from above by…

Number Theory · Mathematics 2025-10-03 Ethan Simpson Lee , Paweł Nosal

In this paper analyzes \textit{The Erd\H{o}s-Straus conjecture} asserts that $f$$(n)$ $>$ 0 for every $n$ $\geq$ 2, where $f(n)$ indicates the number of solutions to the Diophantine Equation…

General Mathematics · Mathematics 2016-09-02 Elias Rios

For completely multiplicative functions f(n) taking values 1 and -1, under certain conditions on f(n) we show that f(n) changes sign at least x exp(-7(log log x)sqrt(log x)) times as n runs through the integers <= x.

Number Theory · Mathematics 2007-05-23 Ernie Croot

Let $\lambda_{\phi}(n)$ be the Fourier coefficients of a Hecke holomorphic or Hecke--Maass cusp form on ${\rm SL}_2(\mathbb Z)$, and $f$ be any multiplicative function that satisfies two mild hypotheses. We establish a non-trivial upper…

Number Theory · Mathematics 2022-04-19 Yujiao Jiang , Guangshi Lü

We study sums of the shape $\sum_{n \leqslant x} f \left( \lfloor x/n \rfloor \right)$ where $f$ is either the von Mangoldt function or the Dirichlet-Piltz divisor functions. We improve previous estimates when $f = \Lambda$ and $f = \tau$,…

Number Theory · Mathematics 2020-11-26 Olivier Bordellès

We study the double sum $S_\varepsilon(X)$$=$$\sum_{\substack{d,e\le X}}\frac{\mu(d)\mu(e)}{[d,e]^{1+\varepsilon}}$, which converges even in the case $\varepsilon=0$, where $\mu$ denotes the M\"obius function and $[d,e]$ is the least common…

Number Theory · Mathematics 2026-04-02 Olivier Ramaré , Sebastian Zuniga Alterman

We present a new method for approximating real-valued functions on ${\mathbb R}^+$ by linear combinations of exponential functions with complex coefficients. The approach is based on a multi-point Pad\'e approximation of the Laplace…

Numerical Analysis · Mathematics 2026-05-05 Alexey Kuznetsov , Armin Mohammadioroojeh

We obtain approximation results for general positive linear operators satisfying mild conditions, when acting on discontinuous functions and absolutely continuous functions having discontinuous derivatives. The upper bounds, given in terms…

Probability · Mathematics 2024-10-29 José A. Adell , P. Garrancho , F. J. Martínez-Sánchez

We investigate the almost sure asymptotic properties of vector martingale transforms. Assuming some appropriate regularity conditions both on the increasing process and on the moments of the martingale, we prove that normalized moments of…

Probability · Mathematics 2018-12-05 Bernard Bercu , Peggy Cénac , Guy Fayolle

Let $\{a_n\}_{n\in\mathbb{N}}$, $\{b_n\}_{n\in \mathbb{N}}$ be two infinite subsets of positive integers and $\psi:\mathbb{N}\to \mathbb{R}_{>0}$ be a positive function. We completely determine the Hausdorff dimensions of the set of all…

Number Theory · Mathematics 2024-09-30 Bing Li , Ruofan Li , Yufeng Wu

We prove a probabilistic Fourier extension theorem that says Fourier extension holds when averaged over certain smooth Alpert multipliers. The proofs use smooth Alpert wavelets with the classical techniques of stationary phase and…

Classical Analysis and ODEs · Mathematics 2026-04-16 Eric T. Sawyer

Let v be a multiplicative arithmetic function with support of positive asymptotic density. We prove that for any not identically zero arithmetic function f such that \sum_{f(n) \neq 0} 1 / n < \infty, the support of the Dirichlet…

Number Theory · Mathematics 2014-10-31 Carlo Sanna

We study monotonicity testing of functions $f \colon \{0,1\}^d \to \{0,1\}$ using sample-based algorithms, which are only allowed to observe the value of $f$ on points drawn independently from the uniform distribution. A classic result by…

Data Structures and Algorithms · Computer Science 2024-08-21 Hadley Black

A strong error estimate for the uniform rational approximation of $x^\alpha$ on $[0,1]$ is given, and its proof is sketched. Let $E_{nn}(x^\alpha,[0,1])$ denote the minimal approximation error in the uniform norm. Then it is shown that…

Classical Analysis and ODEs · Mathematics 2008-02-03 Herbert Stahl

We give sufficient conditions for the bounded law of the iterated logarithms for strictly stationary random fields when the summation is done on rectangle. The study is done by the control of an appropriated maximal function. The case of…

Probability · Mathematics 2021-03-30 Davide Giraudo