Skip to main content
padlock icon - secure page this page is secure

Exponential Structures

Buy Article:

$59.00 + tax (Refund Policy)

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 References
No Citations
No Supplementary Data
No Article Media
No Metrics

Document Type: Research Article

Affiliations: Massachusetts Institute of Technology

Publication date: July 1, 1978

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more