Metraipolis › archive › dc_492db613df76
Initial Runs in Integer Compositions: Lambert Series and Generalized Divisor Sums — arXiv:2609.30314
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.30314
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T02:59:07.937Z
- SHA-256 of the archived text
0601d5178810de9d9571e2ab8d72ffec02ce5c92bafdb5851bca7b61661b79ad- Stable URL of this page
https://metraipolis.com/documento/dc_492db613df76
How to cite
Initial Runs in Integer Compositions: Lambert Series and Generalized Divisor Sums — arXiv:2609.30314 — arXiv (en), https://arxiv.org/abs/2609.30314 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_492db613df76 (Metraipolis archive dc_492db613df76, sha256 0601d5178810de9d9571e2ab8d72ffec02ce5c92bafdb5851bca7b61661b79ad)
BibTeX
@misc{dc492db613df76,
title = {Initial Runs in Integer Compositions: Lambert Series and Generalized Divisor Sums — arXiv:2609.30314},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.30314},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_492db613df76; sha256 0601d5178810de9d9571e2ab8d72ffec02ce5c92bafdb5851bca7b61661b79ad},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30314. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-28 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.30314 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T02:28:17.901Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).