English
Related papers

Related papers: Sommes friables de fonctions multiplicatives al\'e…

200 papers

We consider logarithmic averages, over friable integers, of non-negative multiplicative functions. Under logarithmic, one-sided or two-sided hypotheses, we obtain sharp estimates that improve upon known results in the literature regarding…

Number Theory · Mathematics 2024-09-24 Gérald Tenenbaum , Jie Wu

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

Polynomial functions $f : \mathbb{N}_+ \longrightarrow \mathbb{N}_+$ are studied for which sums of arbitrary length $f (1) + f (2) + f (3) + >... + f (n)$, with $n \in \mathbb{N}_+$, can be expressed by polynomial functions $g :…

General Mathematics · Mathematics 2007-05-23 Elemer E Rosinger

Let $r,\,f$ be multiplicative functions with $r\geqslant 0$, $f$ is complex valued, $|f|\leqslant r$, and $r$ satisfies some standard growth hypotheses. Let $x$ be large, and assume that, for some real number $\tau$, the quantities…

Number Theory · Mathematics 2025-12-19 Gérald Tenenbaum

Consider a multiplicative function f(n) taking values on the unit circle. Is it possible that the partial sums of this function are bounded? We show that if we weaken the notion of multiplicativity so that f(pn)=f(p)f(n) for all primes p in…

Number Theory · Mathematics 2011-08-09 Joseph Vandehey

In 1977 Montgomery and Vaughan gave tight bounds for exponential sums of the form $\sum_{n\leq x}f(n)e(n\alpha)$ where $f$ is a $1$-bounded multiplicative function and $\alpha\in\mathbb R$, close to the conjectured $\ll \frac{x}{\sqrt{q}}+…

Number Theory · Mathematics 2026-04-03 Andrew Granville , Youness Lamzouri

Let $\Delta_x f(x,y)=f(x+1,y)-f(x,y)$ and $\Delta_y f(x,y)=f(x,y+1)-f(x,y)$ be the difference operators with respect to $x$ and $y$. A rational function $f(x,y)$ is called summable if there exist rational functions $g(x,y)$ and $h(x,y)$…

Symbolic Computation · Computer Science 2014-08-12 Qing-Hu Hou , Rong-Hua Wang

In this note, an upper bound for the sum of fractional parts of certain smooth functions is established. Such sums arise naturally in numerous problems of analytic number theory. The main feature is here an improvement of the main term due…

Number Theory · Mathematics 2019-01-03 Olivier Bordellès

We examine the conditions under which the sum of random multiplicative functions in short intervals, given by $\sum_{x<n \leqslant x+y} f(n)$, exhibits the phenomenon of \textit{better than square-root cancellation}. We establish that the…

Number Theory · Mathematics 2024-02-12 Rachid Caich

Let $X$ be a random variable with distribution function $F,$ and $X_{1},X_{2},...,X_{n}$ are independent copies of $X.$ Consider the order statistics $X_{i:n},$ $i=1,2,...,n$ and denote $F_{i:n}(x)=P\{X_{i:n}\leq x\}.$ Using majorization…

Statistics Theory · Mathematics 2011-09-02 Ismihan Bairamov

We evaluate friable averages of arithmetic functions whose Dirichlet series is analytically close to some negative power of the Riemann zeta function. We obtain asymptotic expansions resembling those provided by the Selberg-Delange method…

Number Theory · Mathematics 2024-07-23 Régis de la Bretèche , Gérald Tenenbaum

Let $F(X_1,X_2)\in\mathbb{Z}[X_1,X_2] $ be an irreducible binary form of degree $3$ and $h$ an arithmetic function. We give some estimates for the average order $\sum_{\substack{|n_1|\leq x,|n_2|\leq x}}h(F(n_1,n_2))$ when $h$ satisfy…

Number Theory · Mathematics 2014-08-12 Armand Lachand

Given a suitable arithmetic function h, we investigate the average order of h as it ranges over the values taken by an integral binary form F. A general upper bound is obtained for this quantity, in which the dependence upon the…

Number Theory · Mathematics 2015-06-26 R. de la Breteche , T. D. Browning

We establish several sum-product estimates over finite fields that involve polynomials and rational functions. First, |f(A)+f(A)|+|AA| is substantially larger than |A| for an arbitrary polynomial f over F_p. Second, a characterization is…

Combinatorics · Mathematics 2014-02-26 Boris Bukh , Jacob Tsimerman

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…

Number Theory · Mathematics 2021-01-01 Adam J. Harper

A $\textit{square-full}$ number is a positive integer for which all its prime divisors divide itself at least twice. The counting function of square-full integers of the form $f(n)$ for $n\leqslant N$ is denoted by…

Number Theory · Mathematics 2026-01-14 Watcharakiete Wongcharoenbhorn , Yotsanan Meemark

We establish an asymptotic formula for the logarithmic mean value of a 1-bounded multiplicative function that is sharp in many cases of interest. We derive from it a variety of applications, making progress on several old problems. As a…

Number Theory · Mathematics 2026-04-09 Oleksiy Klurman , Alexander P. Mangerel

In this paper we obtain asymptotic expansion for the geometric mean of the values of positive strongly multiplicative function $f$ satisfying $f(p)=\alpha(d)\,p^d+O(p^{d-\delta})$ for any prime $p$ with $d$ real and $\alpha(d),\delta>0$.

Number Theory · Mathematics 2023-06-22 Mehdi Hassani , Mohammadreza Esfandiari

This is the second 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…

Number Theory · Mathematics 2014-05-29 P. D. T. A. Elliott , Jonathan Kish

Let $f$ be a real arithmetic function and let $g:[1,\infty[\to{\mathbb R}$ be a smooth function. We describe two emblematic instances in which saddle-point estimates may be used to evaluate the frequency, on the set of integers $n\leqslant…

Number Theory · Mathematics 2026-03-12 Gérald Tenenbaum