Search arXivSearch

arXiv · 2505.07051

Some Observations about the "Generalized Abundancy Index"

Abstract

Let $\mathcal{A}(\ell,n) \subset S_n^{\ell}$ denote the set of all $\ell$-tuples $(π_1,\dots,π_{\ell})$, for $π_1,\dots,π_{\ell} \in S_n$ satisfying: $\forall i<j$ we have $π_iπ_j=π_jπ_i$. Considering the action of $S_n$ on $[n]=\{1,\dots,n\}$, let $κ(π_1,\dots,π_{\ell})$ be equal to the number of orbits of the action of the subgroup $\langle π_1,\dots,π_{\ell} \rangle \subset S_n$. There has been interest in the study of the combinatorial numbers $A(\ell,n,k)$ equal to the cardinalities $|\{(π_1,\dots,π_{\ell}) \in \mathcal{A}(\ell,n)\, :\, κ(π_1,\dotsπ_{\ell})=k\}|$. If one defines $B(\ell,n)=A(\ell,n,1)/(n-1)!$, then it is known that $B(\ell,n) = \sum_{(f_1,\dots,f_{\ell}) \in \mathbb{N}^{\ell}} \mathbf{1}_{\{n\}}(f_1\cdots f_{\ell}) \prod_{r=1}^{\ell-1} f_r^{\ell-r}$. A special case, $\ell=2$, is $B(2,n) = \sum_{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(\ell,n) n^{-\ell+1}$ the ``generalized abundancy index.'' Building on work of Abdesselam, using the probability model, we prove that $\lim_{N \to \infty} N^{-1} \sum_{n=1}^{N} B(\ell,n) n^{-\ell+1}$ equals $ζ(2)\cdots ζ(\ell)$. Motivated by this we state a more precise conjecture for the asymptotics of $-ζ(2) + N^{-1}\sum_{n=1}^{N} (B(2,n)/n)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shannon Starr. 2025-05-13. Some Observations about the "Generalized Abundancy Index". https://arxiv.org/abs/2505.07051

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO