Printer Friendly

Introduction to combinatorics.


Introduction to combinatorics.

Wallis, W.D. and J.C. George.

CRC Press


380 pages



Discrete mathematics and its applications


In a textbook for an introductory course on combinatorics, typically offered about the junior year, Wallis (Southern Illinois U.-Carbondale) and George (Gordon College, Georgia) describe the field as a branch of mathematics that deals with different ways of selecting objects from a set or arranging objects. They begin with a few examples, just to let students get a feel for it, then look at fundamentals of enumeration; the pigeonhole principle and Ramsey's theorem; the principle of inclusion and exclusion; generating functions and recurrence relations; Catalan, Bell, and Stirling numbers; symmetries and the Polya-Redfield method; graph theory; coding theory; Latin squares; balanced incomplete block designs; and linear algebra methods in combinatorics. Solutions for some exercises are included.

([c]2010 Book News, Inc., Portland, OR)

COPYRIGHT 2010 Book News, Inc.
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2010 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Publication:SciTech Book News
Article Type:Brief article
Date:Dec 1, 2010
Previous Article:PhiMSAMP; philosophy of mathematics: sociological aspsects and mathematical practice.
Next Article:Annual review of chemical and biomolecular engineering; v.1, 2010.

Terms of use | Privacy policy | Copyright © 2020 Farlex, Inc. | Feedback | For webmasters