Answers are grounded in this paper and cite their sources.
This paper deals with q-series arising from the study of the transitive closure problem in random acyclic digraphs. In particular, it presents an identity involving divisor generating functions which allows us to determine the asymptotic behavior of polynomials defined by a general class of recursive equations, including the polynomials for the mean and the variance of the size of the transitive closure in random acyclic digraphs.
No takes yet. Share an insight, caveat, or question.
Andrews et al. (1997) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: