Combinatorial Methods in Discrete Mathematics

V. Sachkov, Vladimir Nikolaevich Sachkov

ISBN 10: 0521455138 / ISBN 13: 9780521455138

Published by Cambridge University Press, 2008

About this Item

Zustand: Sehr gut | Seiten: 324 | Sprache: Englisch | Produktart: Bücher | 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.

Seller Inventory # 1489994/2

Bibliographic Details

• Title: Combinatorial Methods in Discrete Mathematics
• Publisher: Cambridge University Press
• Publication Date: 2008
• Language: English
• ISBN 10: 0521455138
• ISBN 13: 9780521455138
• Binding: Hardcover
• Condition: Sehr gut
• Seller catalogs:
  • Bücher

About this title

Synopsis

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.

From the Back Cover

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.