Limit this search to....

Combinatorial Methods in Discrete Mathematics
Contributor(s): Sachkov, V. (Author), Sachkov, Vladimir Nikolaevich (Author), Kolchin, V. (Translator)
ISBN: 0521455138     ISBN-13: 9780521455138
Publisher: Cambridge University Press
OUR PRICE:   $134.90  
Product Type: Hardcover - Other Formats
Published: January 1996
Qty:
Annotation: This is an attempt to present some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. The author's aim is not always to present the most general results, but rather to focus attention on those that illustrate the methods described. A distinctive aspect of the book is the large number of asymptotic formulae derived. Professor Sachkov begins with a discussion of block designs and Latin squares before proceeding to treat transversals, devoting much attention to enumerative problems. The main role in these problems is played by generating functions, which are considered in Chapter 4. The general combinatorial scheme is then introduced and, in the final chapter, Polya's enumerative theory is discussed. This is an important book, describing many ideas not previously available in English; the author has taken the opportunity to update the text and references where appropriate.
Additional Information
BISAC Categories:
- Mathematics | Discrete Mathematics
Dewey: 511.6
LCCN: 94030890
Series: Encyclopedia of Mathematics and Its Applications
Physical Information: 0.93" H x 6.4" W x 9.65" (1.40 lbs) 324 pages
 
Descriptions, Reviews, Etc.
Publisher Description:
Discrete mathematics is an important tool for the investigation of various models of functioning of technical devices, especially in the field of cybernetics. Here the author presents some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. Professor Sachkov's aim is to focus attention on results that illustrate the methods described. A distinctive aspect of the book is the large number of asymptotic formulae derived. Professor Sachkov begins with a discussion of block designs and Latin squares before proceeding to treat transversals, devoting much attention to enumerative problems. The main role in these problems is played by generating functions, considered in Chapter 4. The general combinatorial scheme is then introduced and in the last chapter Polya's enumerative theory is discussed. This is an important book for graduate students and professionals that describes many ideas not previously available in English; the author has updated the text and references where appropriate.