have proofs and are immediately followed by corollaries. The typography, although generally very good, does not support this; the label Example is given in a rather small font followed by a PROOF, and the body of an example is nonitalic, utterly unlike other statements accompanied by demonstrations. The proofs of some theorems are continued after the statements and proofs of needed lemmas with no helpful demarcations ( Continuation of proof of Theorem . . . ). Finally, at least one lemma (3.34) has a corollary with no theorem or proposition in sight; the status of Lemma 3.36 is also unclear. Lemma 1.16 on page 12 giving a closed formula for Stirling numbers of the second kind is important enough to gure in the proof of capstone Theorem 3.71 (Schl¨milch s o formula) on page 114. This nonstandard approach to chapter organization may impede some readers comprehending the structure of the author s highly purposeful discussion. Review of 3 Enumerative Combinatorics Author of Book: Charalambos A. Charalambides Publisher: Chapman & Hall/CRC ISBN L-58488-290-5, Hard Cover, 609 pages Reviewer: Sergey Kitaev Mathematics Institute, Reykjav´ University, Reykjav´ Iceland, sergey@ru.is ık ık, Introduction Combinatorics is a branch of mathematics
/lp/association-for-computing-machinery/enumerative-combinatorics-P0lN8L5M6T