Some Observations about the "Generalized Abundancy Index"
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·s f) Πr=1-1 fr-r. A special case, =2, is B(2,n) = Σd|n d = σ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 N ∞ N-1 Σn=1N B(,n) n-+1 equals ζ(2)·s ζ(). Motivated by this we state a more precise conjecture for the asymptotics of -ζ(2) + N-1Σn=1N (B(2,n)/n).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.