Initial Runs in Integer Compositions: Lambert Series and Generalized Divisor Sums
Abstract
We study the initial run of equal adjacent parts in an integer composition. For a composition alpha, let P(alpha) be the common value of the parts in the initial run, let K(alpha) be the number of parts in that run, and set S(alpha)=P(alpha)K(alpha). We obtain exact finite formulas for the joint parameters (P,K,S) and the corresponding limiting laws. In the unrestricted model, each fixed event (P,K)=(p,k) reaches its limiting probability once n is above an explicit threshold. The limiting distribution of the total size is P(S=s)=2^{-s} sum_{d|s}(1-2^{-d}). Pointing a unit cell in the initial run gives M_1(z)=((1-z)/(1-2z)) sum_{m>=1} sigma_1(m) z^m. For every r>=1, the r-th power-moment generating function has coefficient function A_r(n)=sum_{j=1}^r (-1)^{j+1} binom(r,j) n^{r-j} sigma_j(n), so higher moments involve explicit finite combinations of generalized divisor sums. We also give factorial-moment formulas for the initial-run length and extend the construction to compositions with parts in a prescribed set A, where the corresponding formulas involve restricted divisor sums and the dominant root of the part generating function. Copy
Related
- Exceptional sets for compositions involving Euler's function,the divisor-sum function and Dedekind's function
- Additive Sums of Generalized Shifted Ternary Divisor Functions
- Generalized Graph Compositions with Applications to Difference Graphs of Finite Groups
- Generalized divisor topology of commutative rings
- Hyponormality of Generalized Cesàro Matrices of Every Positive Integer Order
BibTeX
@misc{kleiner2026initial,
title = {{Initial Runs in Integer Compositions: Lambert Series and Generalized Divisor Sums}},
author = {Igor Kleiner},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.30314},
eprint = {2609.30314},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.30314},
}
RIS
TY - UNPB
TI - Initial Runs in Integer Compositions: Lambert Series and Generalized Divisor Sums
AU - Igor Kleiner
PY - 2026
DA - 2026/09/01
PB - arXiv
DO - 10.48550/arxiv.2609.30314
UR - https://arxiv.org/abs/2609.30314
AB - We study the initial run of equal adjacent parts in an integer composition. For a composition alpha, let P(alpha) be the common value of the parts in the initial run, let K(alpha) be the number of parts in that run, and set S(alpha)=P(alpha)K(alpha). We obtain exact finite formulas for the joint parameters (P,K,S) and the corresponding limiting laws. In the unrestricted model, each fixed event (P,K)=(p,k) reaches its limiting probability once n is above an explicit threshold. The limiting distribution of the total size is P(S=s)=2^{-s} sum_{d|s}(1-2^{-d}). Pointing a unit cell in the initial run gives M_1(z)=((1-z)/(1-2z)) sum_{m>=1} sigma_1(m) z^m. For every r>=1, the r-th power-moment generating function has coefficient function A_r(n)=sum_{j=1}^r (-1)^{j+1} binom(r,j) n^{r-j} sigma_j(n), so higher moments involve explicit finite combinations of generalized divisor sums. We also give factorial-moment formulas for the initial-run length and extend the construction to compositions with parts in a prescribed set A, where the corresponding formulas involve restricted divisor sums and the dominant root of the part generating function. Copy
ER -