Central and East European
Society for Phenomenology

Repository | Book | Chapter

193286

Enumerative combinatorics on words

pp. 391-427

Abstract

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

Published in:

Crapo Henry, Senato Domenico (2001) Algebraic combinatorics and computer science: a tribute to Gian-Carlo Rota. Dordrecht, Springer.

Pages: 391-427

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, 391–427.