English
Related papers

Related papers: Arithmetic functions at factorial arguments

200 papers

We examine oscillations in a number of sums of arithmetic functions involving $\Omega(n)$, the total number of prime factors of $n$, and $\omega(n)$, the number of distinct prime factors of $n$. In particular, we examine oscillations in…

Number Theory · Mathematics 2020-12-15 Michael J. Mossinghoff , Timothy S. Trudgian

The integer $d$ is called an exponential divisor of $n=\prod_{i=1}^r p_i^{a_i}>1$ if $d=\prod_{i=1}^r p_i^{c_i}$, where $c_i \mid a_i$ for every $1\le i \le r$. The integers $n=\prod_{i=1}^r p_i^{a_i}, m=\prod_{i=1}^r p_i^{b_i}>1$ having…

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

We introduce new analogues of the Ramanujan sums, denoted by $\widetilde{c}_q(n)$, associated with unitary divisors, and obtain results concerning the expansions of arithmetic functions of several variables with respect to the sums…

Number Theory · Mathematics 2018-06-12 László Tóth

In this paper we prove the mean values of some multiplicative functions connected with the divisor function on the short interval of summation.

Number Theory · Mathematics 2016-11-04 A. A. Sedunova

We study the questions of determining the asymptotics of the probabilistic characteristics of additive arithmetic functions in the paper, regardless of whether they have a limit distribution or not. Several assertions are proved about the…

Number Theory · Mathematics 2021-08-31 Victor Volfson

For $k\geq 2$, we give a detailed exposition of the superior $k$-highly composite numbers. We then consider the function \[f_k(n)=\frac{\log d_k(n)\log\log n}{\log k\log n},\quad n\geq 3\] which has a maximum value $\lambda(k)$ at a…

Number Theory · Mathematics 2025-11-25 Lee-Peng Teo

We study the asymptotics of the moments of arithmetic functions that have a limit distribution, not necessarily normal, defined on a subset of the natural series that satisfies certain requirements. Several assertions are proved on…

Number Theory · Mathematics 2022-07-06 Victor Volfson

Let $\mathbf{P} \subset [H_0,H]$ be a set of primes, where $\log H_0 \geq (\log H)^{2/3 + \epsilon}$. Let $\mathscr{L} = \sum_{p \in \mathbf{P}} 1/p$. Let $N$ be such that $\log H \leq (\log N)^{1/2-\epsilon}$. We show there exists a subset…

Number Theory · Mathematics 2021-04-14 Harald Andrés Helfgott , Maksym Radziwiłł

Let $F(x)= \sum_{\nu\in\NN^d} F_\nu x^\nu$ be a multivariate power series with complex coefficients that converges in a neighborhood of the origin. Assume $F=G/H$ for some functions $G$ and $H$ holomorphic in a neighborhood of the origin.…

Combinatorics · Mathematics 2012-08-07 Alexander Raichev , Mark C. Wilson

We establish new upper and lower bounds on the number of queries required to test convexity of functions over various discrete domains. 1. We provide a simplified version of the non-adaptive convexity tester on the line. We re-prove the…

Computational Complexity · Computer Science 2019-08-08 Aleksandrs Belovs , Eric Blais , Abhinav Bommireddi

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

The partition function, $p_A(n)$, is defined to be the number of partitions of $n$ with parts in the set A, where $n$ is a positive integer and $A$ is a set of positive integers. It is well documented that: if A is a finite set with…

Combinatorics · Mathematics 2025-09-23 David Christopher , Davamani Christober

For a nonempty finite set $A$ of positive integers, let $\gcd\left(A\right)$ denote the greatest common divisor of the elements of $A$. Let $f\left(n\right)$ and $\Phi\left(n\right)$ denote, respectively, the number of subsets $A$ of…

Number Theory · Mathematics 2013-06-21 Prapanpong Pongsriiam

Consider the Riemann sum of a smooth compactly supported function h(x) on a polyhedron in R^d, sampled at the points of the lattice Z^d/t. We give an asymptotic expansion when t goes to infinity, writing each coefficient of this expansion…

Classical Analysis and ODEs · Mathematics 2015-04-30 Nicole Berline , Michele Vergne

The Additive Transform of an arithmetic function represents a novel approach to examining the interplay between multiplicative arithmetic function and additive functions. This transform concept introduces a method to systematically generate…

General Mathematics · Mathematics 2023-12-15 E. En-naoui

The paper considers estimates for the asymptotics of summation functions of bounded multiplicative arithmetic functions. Several assertions on this subject are proved and examples are considered.

General Mathematics · Mathematics 2023-04-11 Victor Volfson

We study sums of a random multiplicative function; this is an example, of number-theoretic interest, of sums of products of independent random variables (chaoses). Using martingale methods, we establish a normal approximation for the sum…

Number Theory · Mathematics 2010-12-02 Adam J. Harper

Let $d(n)$ be the Dirichlet divisor function and $\Delta(x)$ denote the error term of the sum $\sum_{n\leqslant x}d(n)$ for a large real variable $x$. In this paper we focus on the sum $\sum_{p\leqslant x}\Delta^2(p)$, where $p$ runs over…

Number Theory · Mathematics 2024-10-02 Zhen Guo , Xin Li

Let $f_1,\ldots,f_k : \mathbb{N} \rightarrow \mathbb{C}$ be multiplicative functions taking values in the closed unit disc. Using an analytic approach in the spirit of Hal\'{a}sz' mean value theorem, we compute multidimensional averages of…

Number Theory · Mathematics 2017-08-11 Oleksiy Klurman , Alexander P. Mangerel

For a function $f\colon \mathbb{N}\to\mathbb{N}$, let $$ N^+_f(x)=\{n\leq x: n=k+f(k) \mbox{ for some } k\}. $$ Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…

Number Theory · Mathematics 2023-06-29 Mikhail R. Gabdullin , Vitalii V. Iudelevich , Florian Luca
‹ Prev 1 8 9 10 Next ›