O'Reilly logo

Enumerative Combinatorics by Sergey Fomin, Richard P. Stanley

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Additional Errata and Addenda

1   p. 74, Exercise 5.8(a). The stated formula for T(n, k) fails for n = 0. Also, it makes more sense to define T(0, 0) = 1.
2   p. 81, Exercise 5.24(d). A solution was found by the Cambridge Combinatorics and Coffee Club (February 2000).
3   p. 124, Exercise 5.28. A bijective proof based on Prüfer codes is due to the Cambridge Combinatorics and Coffee Club (December 1999).
4   p. 124, Exercise 5.29(b). Update the Pitman reference to J. Combinatorial Theory (A) 85 (1999), 165–193. Further results on Pn and related posets are given by D. N. Kozlov, J. Combinatorial Theory (A) 88 (1999), 112–122.
5   p. 136, last line of Exercise 5.41(j). A solution different from the one above was given by S. C. Locke, ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required