Arithmetical semigroups related to trees and polyhedra (Q1284470)

The authors formulate various enumeration questions involving isomorphism classes of certain graphs, trees, or polyhedra in terms of additive arithmetical semigroups in which, roughly speaking, every non-trivial element has an essential unique decomposition into prime elements. Let \(p_n\) and \(y_n\) denote the number of prime elements of size \(n\) and the total number of elements of size \(n\). They establish what they call an abstract (inverse) prime number theorem of the following form. Suppose \(p_n\sim Cq^n n^{-\alpha}\) for constants \(C>0\), \(q>1\), and \(\alpha>1\). Then \(y_n\sim ZCq^n n^{-\alpha}\), where \(Z= \sum y_r q^{-r}\).