Repository | Book | Chapter
(2001) Algebraic combinatorics and computer science, Dordrecht, Springer.
Enumerative combinatorics on words
pp. 391-427
Generating series, also called generating functions, play an important role in combinatorial mathematics. Many enumeration problems can be solved by transferring the basic operations on sets into algebraic operations on formal series leading to a solution of an enumeration problem. The famous paper by Doubilet, Rota and Stanley, The idea of generating function [40], places the subject in a general mathematical frame-work allowing one to present in a unified way the diversity of generating functions, from the ordinary ones to the exponential or even Dirichlet.
Publication details
DOI: 10.1007/978-88-470-2107-5_16
Full citation:
(2001)., Enumerative combinatorics on words, in H. Crapo & D. Senato (eds.), Algebraic combinatorics and computer science, Dordrecht, Springer, pp. 391-427.
This document is unfortunately not available for download at the moment.