Abstract
This paper presents a combinatorial theory of formal power series. The combinatorial interpretation of formal power series is based on the concept of species of structures. A categorical approach is used to formulate it. A new proof of Cayley's formula for the number of labelled trees is given as well as a new combinatorial proof (due to G. Labelle) of Lagrange's inversion formula. Polya's enumeration theory of isomorphism classes of structures is entirely renewed. Recursive methods for computing cycle index polynomials are described. A combinatorial version of the implicit function theorem is stated and proved. The paper ends with general considerations on the use of coalgebras in combinatorics.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
