An asymptotic formula for the logarithm of generalized partition functions (Q2422101)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An asymptotic formula for the logarithm of generalized partition functions |
scientific article |
Statements
An asymptotic formula for the logarithm of generalized partition functions (English)
0 references
18 June 2019
0 references
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\)).
0 references
partitions
0 references
Hardy-Ramanujan formula
0 references
number of prime factors
0 references