Some Observations about the "Generalized Abundancy Index"
Combinatorics
2025-05-15 v2 Number Theory
Probability
Abstract
Let A(ℓ,n)⊂Snℓ denote the set of all ℓ-tuples (π1,…,πℓ), for π1,…,πℓ∈Sn satisfying: ∀i<j we have πiπj=πjπi. Considering the action of Sn on [n]={1,…,n}, let κ(π1,…,πℓ) be equal to the number of orbits of the action of the subgroup ⟨π1,…,πℓ⟩⊂Sn. There has been interest in the study of the combinatorial numbers A(ℓ,n,k) equal to the cardinalities ∣{(π1,…,πℓ)∈A(ℓ,n):κ(π1,…πℓ)=k}∣. If one defines B(ℓ,n)=A(ℓ,n,1)/(n−1)!, then it is known that B(ℓ,n)=∑(f1,…,fℓ)∈Nℓ1{n}(f1⋯fℓ)∏r=1ℓ−1frℓ−r. A special case, ℓ=2, is B(2,n)=∑d∣nd=σ1(n) the sum-of-divisors function. Then A(2,n,1)/n!=B(2,n)/n is called the abundancy index: σ1(n)/n. We call B(ℓ,n)n−ℓ+1 the ``generalized abundancy index.'' Building on work of Abdesselam, using the probability model, we prove that limN→∞N−1∑n=1NB(ℓ,n)n−ℓ+1 equals ζ(2)⋯ζ(ℓ). Motivated by this we state a more precise conjecture for the asymptotics of −ζ(2)+N−1∑n=1N(B(2,n)/n).
Cite
@article{arxiv.2505.07051,
title = {Some Observations about the "Generalized Abundancy Index"},
author = {Shannon Starr},
journal= {arXiv preprint arXiv:2505.07051},
year = {2025}
}
Comments
added 1 reference