Generating functions of the type occur throughout enumerative combinatorics. We give a general setting for obtaining such generating functions in which the numbers M (n) have an explicit combinatorial meaning. Applications are given to the computation of Möbius functions and related invariants of certain posets.
No Supplementary Data
No Article Media
Document Type: Research Article
Affiliations: Massachusetts Institute of Technology
Publication date: July 1, 1978