English
Related papers

Related papers: A statistical investigation of a divisor-sum funct…

200 papers

We investigate fractional sums of arithmetic functions over products of two or three integers, with emphasis on fixed greatest common divisors and multiplicative weights. Let $f$ be an arithmetic function satisfying $f(n) \ll n^\alpha$ for…

Number Theory · Mathematics 2026-02-16 Meselem Karras

In this paper, we prove that the dimension of the space spanned by the characters of the symmetric powers of the standard n-dimensional representation of the symmetric group S_n is asymptotic to n^2/2. This is proved by using generating…

Combinatorics · Mathematics 2007-05-23 David Savitt , Richard P. Stanley

Let ${\cal H}=(q_1, \ldots q_r)$ be a finite set of coprime integers and let $n_1, n_2, \ldots$ denote the multiplicative semigroup generated by $\cal H$ and arranged in increasing order. The distribution of such sequences has been studied…

Number Theory · Mathematics 2014-01-13 Christoph Aistleitner , Istvan Berkes , Robert Tichy

We establish power saving asymptotics for the sum of the divisor function along a binary quartic form, improving on work of Daniel. The proof involves an application of a recent two dimensional delta method due to Li, Rydin-Myerson, and…

Number Theory · Mathematics 2026-01-20 Wing Hong Leung , Mayank Pandey

Most existing methods for testing equality of means of functional data from multiple populations rely on assumptions of equal covariance and/or Gaussianity. In this work we provide a new testing method based on a statistic that is…

Methodology · Statistics 2025-09-30 Chuang Xu , Andrew T. A. Wood , Yanrong Yang

The sequence of middle divisors is shown to be unbounded. For a given number $n$, $a_{n,0}$ is the number of divisors of $n$ in between $\sqrt{n/2}$ and $\sqrt{2n}$. We explicitly construct a sequence of numbers $n(i)$ and a list of…

Number Theory · Mathematics 2016-07-08 Jon Eivind Vatne

The divisor function $\sigma(n)$ denotes the sum of the divisors of the positive integer $n$. For a prime $p$ and $m \in \mathbb{N}$, the $p$-adic valuation of $m$ is the highest power of $p$ which divides $m$. Formulas for…

Number Theory · Mathematics 2020-07-08 Tewodros Amdeberhan , Victor H. Moll , Vaishavi Sharma , Diego Villamizar

Let $\mathsf{s}(n)$ denote the sum of binary digits of an integer $n \geq 0$. In the recent years there has been interest in the behavior of the differences $\mathsf{s}(n+t)-\mathsf{s}(n)$, where $t \geq 0$ is an integer. In particular,…

Number Theory · Mathematics 2024-12-23 Bartosz Sobolewski

Let $s_2$ be the sum-of-digits function in base $2$, which returns the number of non-zero binary digits of a nonnegative integer $n$. We study $s_2$ alon g arithmetic subsequences and show that --- up to a shift --- the set of $m$-tuples of…

Number Theory · Mathematics 2020-02-26 Lukas Spiegelhofer , Thomas Stoll

We prove a new equidistribution estimate for the divisor function in arithmetic progression to moduli that have two small factors. We give two applications. First, we show an asymptotic formula for the divisor function over arithmetic…

Number Theory · Mathematics 2025-09-05 Lasse Grimmelt , Jori Merikoski

The concept of median/consensus has been widely investigated in order to provide a statistical summary of ranking data, i.e. realizations of a random permutation $\Sigma$ of a finite set, $\{1,\; \ldots,\; n\}$ with $n\geq 1$ say. As it…

Machine Learning · Computer Science 2022-01-21 Morgane Goibert , Stéphan Clémençon , Ekhine Irurozki , Pavlo Mozharovskyi

This paper investigates the randomness properties of a function of the divisor pairs of a natural number. This function, the antecedents of which go to very ancient times, has randomness properties that can find applications in…

Cryptography and Security · Computer Science 2012-11-22 Subhash Kak

The normalised partial sums of values of a nonnegative multiplicative function over divisors with appropriately restricted sizes of a random permutation from the symmetric group define trajectories of a stochastic process. We prove a…

Probability · Mathematics 2026-01-14 Eugenijus Manstavičius

The coordinates along any fixed direction(s), of points on the sphere $S^{n-1}(\sqrt{n})$, roughly follow a standard Gaussian distribution as $n$ approaches infinity. We revisit this classical result from a nonstandard analysis perspective,…

Probability · Mathematics 2024-10-17 Irfan Alam

We show that the expected asymptotic for the sums $\sum_{X < n \leq 2X} \Lambda(n) \Lambda(n+h)$, $\sum_{X < n \leq 2X} d_k(n) d_l(n+h)$, and $\sum_{X < n \leq 2X} \Lambda(n) d_k(n+h)$ hold for almost all $h \in [-H,H]$, provided that…

Number Theory · Mathematics 2019-02-19 Kaisa Matomäki , Maksym Radziwiłł , Terence Tao

We study the asymptotic behaviour of the classical Dedekind sums $s(s_k/t_k)$ for the sequence of convergents $s_k/t_k$ $k\ge 0$, of the transcendental number \BD \sum_{j=0}^\infty\frac {1}{b^{2^j}},\ b\ge 3. \ED In particular, we show that…

Number Theory · Mathematics 2013-04-12 Kurt Girstmair

The distribution function of the sum of i.i.d. random variables of the special form is considered. Such sum describes messages posterior probabilities for random coding in binary symmetric channel. Close non-asymptotic lower and upper…

Information Theory · Computer Science 2025-01-17 M. V. Burnashev

Dedekind sums are well-studied arithmetic sums, with values uniformly distributed on the unit interval. Based on their relation to certain modular forms, Dedekind sums may be defined as functions on the cusp set of $SL(2,\mathbb{Z})$. We…

Number Theory · Mathematics 2024-12-17 Claire Burrin

In this paper, we are interested in the asymptotic behaviour of the sequence of processes $(W_n(s,t))_{s,t\in[0,1]}$ with \begin{equation*} W_n(s,t):=\sum_{k=1}^{\lfloor nt\rfloor}\big(1_{\{\xi_{S_k}\leq s\}}-s\big) \end{equation*} where…

Probability · Mathematics 2019-12-17 Nadine Guillotin-Plantard , Francoise Pene , Martin Wendler

Let $d(n)$ be the divisor function. In 1916, S. Ramanujan stated but without proof that $$\sum_{n\leq x}d^2(n)=xP(\log x)+E(x), $$ where $P(y)$ is a cubic polynomial in $y$ and $$ E(x)=O(x^{{3\over 5}+\epsilon}), $$ where $\epsilon$ is a…

Number Theory · Mathematics 2014-03-25 Chaohua Jia , Ayyadurai Sankaranarayanan