An asymptotic formula for the logarithm of generalized partition functions

Asymptotic results on arithmetic functions (11N37) Distribution functions associated with additive and positive multiplicative functions (11N60) Analytic theory of partitions (11P82)

Review text

Let \(\Lambda=\{\lambda_j\}_{j=1}^\infty\) be a set of positive integers, and let \(p_\Lambda(n)\) be the number of ways of writing \(n\) as a sum of positive integers \(\lambda\in\Lambda\). In this paper, the author assumes that \(\Lambda\) satisfies the following two conditions: (i) for a certain multiplicative function \(\chi\) and for any \(\lambda\in\Lambda\), \(\chi(\lambda)=1\); (ii) for a given additive function \(f\) and given fixed integers \(m\ge 1\) and \(j\ge 0\), \(f(\lambda)\equiv j (\mod m)\) if \(\lambda\in\Lambda\). The author obtains an asymptotic formula for \(\ln{(\sum_{n\le x} p_\Lambda(n))}\sim\ln{p_\Lambda([x])}\) as \(x\to\infty\), with \(\Lambda\) satisfying conditions (i) and (ii) (here \([x]\) denotes the integer part of \(x\)).

Recommendations

Cites work

Cited in

(2)

This page was built for publication: An asymptotic formula for the logarithm of generalized partition functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2422101)