Enumerative Combinatorics, Volume 2
Publisher: Cambridge University Press
Published: January 13, 1999
Language: eng
Format: Hardcover
Number of pages: 594
ISBN-13: 9780521560696
Subjects: Algebra; Combinatorics & graph theory; Mathematical theory of computation; Science/Mathematics; Mathematics; Combinatorics; Mathematics / Probability; Combinatorial enumeration problems; Mensuration; Combinatorial enumeration prob
First sentence: If F(x) and G(x) are formal power series with G(0) = 0, then we have seen (after Proposition 1.1.9) that the composition F(G(x) is a well-defined formal power series.