English
Related papers

Related papers: On the binary additive divisor problem in mean

200 papers

In this paper, we consider the fractional sum of the divisor functions. We can improve previous results considered by Bordell\'{e}s \cite{Bo} and Liu-Wu-Yang \cite{LWY}.

Number Theory · Mathematics 2023-01-18 Wei Zhang

This paper discusses the additive prime divisor function $A(n) := \sum\limits_{p^\alpha || n} \alpha \, p$ which was introduced by Alladi and Erd\H os in 1977. It is shown that $A(n)$ is uniformly distributed (mod $q$) for any fixed integer…

Number Theory · Mathematics 2016-06-21 Dorian Goldfeld

In this paper, we study the sum of the divisor function over sets with digit restrictions.

Number Theory · Mathematics 2024-11-26 Jiseong Kim

Existence of long arithmetic progression in sumsets and subset sums has been studied extensively in the field of additive combinatorics. These additive combinatorics results play a central role in the recent progress of fundamental problems…

Data Structures and Algorithms · Computer Science 2025-04-08 Lin Chen , Yuchen Mao , Guochuan Zhang

We provide a Lyapunov type bound in the multivariate central limit theorem for sums of independent, but not necessarily identically distributed random vectors. The error in the normal approximation is estimated for certain classes of sets,…

Probability · Mathematics 2019-07-24 Martin Raič

The main theme of this paper is to give sufficient conditions for the weighted boundedness of the bilinear fractional integral operator $\mathsf{BI}_\al$. The proposed condition involves the union of multilinear Muckenhoupt-type conditions.…

Functional Analysis · Mathematics 2025-07-22 Cong Hoang

In this paper, we study a combinatorial problem originating in the following conjecture of Erdos and Lemke: given any sequence of n divisors of n, repetitions being allowed, there exists a subsequence the elements of which are summing to n.…

Combinatorics · Mathematics 2012-08-14 Benjamin Girard

We prove new bounds on bilinear forms with Kloosterman sums, complementing and improving a series of results by \'E. Fouvry, E. Kowalski and Ph. Michel (2014), V. Blomer, \'E. Fouvry, E. Kowalski, Ph. Michel and D. Mili\'cevi\'c (2017), E.…

Number Theory · Mathematics 2023-04-18 Bryce Kerr , Igor E. Shparlinski , Xiaosheng Wu , Ping Xi

In this series we examine the calculation of the $2k$th moment and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. The present paper is concerned with the precise…

Number Theory · Mathematics 2015-06-24 Brian Conrey , Jonathan P. Keating

Our interest in this paper is a generalization of the additive Deligne-Simpson problem which is originally defined for Fuchsian differential equations on the Riemann sphere. We shall extend this problem to differential equations having an…

Classical Analysis and ODEs · Mathematics 2017-04-05 Kazuki Hiroe

Maximum subarray is a classical problem in computer science that given an array of numbers aims to find a contiguous subarray with the largest sum. We focus on its use for a noisy statistical problem of localizing an interval with a mean…

Methodology · Statistics 2023-10-24 Dennis Wei , Dmitry M. Malioutov

The object of this paper is to generalize a theorem on the binomial coefficient [4] to the case in an arithmetic progression. We will also give a slightly stronger result than Langevin's [2].

General Mathematics · Mathematics 2009-09-15 Shaohua Zhang

In this paper, we extend previous results to prove that generalized modular forms with rational Fourier expansions whose divisors are supported only at the cusps and certain other points in the upper half plane are actually classical…

Number Theory · Mathematics 2010-07-30 L J P Kilford , Wissam Raji

We show that even mild improvements of the Polya-Vinogradov inequality would imply significant improvements of Burgess' bound on character sums. Our main ingredients are a lower bound on certain types of character sums (coming from works of…

Number Theory · Mathematics 2017-06-12 Elijah Fromm , Leo Goldmakher

Let $d,n$ be positive integers and $S$ be an arbitrary set of positive integers. We say that $d$ is an $S$-divisor of $n$ if $d|n$ and gcd $(d,n/d)\in S$. Consider the $S$-convolution of arithmetical functions given by (1.1), where the sum…

Number Theory · Mathematics 2007-05-23 László Tóth

A quantifier is a supervised machine learning algorithm, focused on estimating the class prevalence in a dataset rather than labeling its individual observations. We introduce Continuous Sweep, a new parametric binary quantifier inspired by…

Machine Learning · Statistics 2024-10-14 Kevin Kloos , Julian D. Karch , Quinten A. Meertens , Mark de Rooij

In the present paper a new mean value theorem for polynomials of special form is obtained. The case of sums on vertices of a regular polygon is studied. A criterion for a certain equation to be satisfied is obtained.

Complex Variables · Mathematics 2013-09-13 Olga D. Trofimenko

The primary objective of this paper is to employ methods from analytic number theory to investigate the mean value properties of a composite function involving the Dirichlet divisor function and a generalized minimal power function.…

Number Theory · Mathematics 2026-02-25 Mihoub Bouderbala

During the study of the topic of limit summability of functions (introduced by the author in 2001), we encountered some types of functions that are related to the mean value theorem. In this paper, we formally define mean value and…

Classical Analysis and ODEs · Mathematics 2021-10-01 M. H. Hooshmand

We prove a new mean value theorem on the distribution of primes in two simultaneous arithmetic progressions. Our approach builds on previous arguments of Bombieri, Fouvry, Friedlander, and Iwaniec appealing to spectral theory of Kloosterman…

Number Theory · Mathematics 2025-12-30 Zongkun Zheng
‹ Prev 1 4 5 6 7 8 10 Next ›