We apply the methods of partition analysis to partitions in which the parity of parts plays a role. We begin with an in-depth treatment of the generating function for the partitions from the first Göllnitz-Gordon identity. We then deduce a Schmidt-type theorem related to the false theta functions. We also consider: (1) position parity, (2) partitions with distinct even parts, (3) partitions with distinct odd parts. One of the corollaries of these last considerations is a new interpretation of Hei-Chi Chan's cubic partitions. A second part of our article is devoted to the algorithmic derivation of identities and arithmetic congruences related to the generating functions considered in part one, including cubic partitions. To this end, Smoot's implementation of Radu's Ramanujan-Kolberg algorithm is used. Finally, we give a short description which explains how to use the Omega package to derive special instances of the results of part one.

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.