+612 9045 4394
Combinatorial Methods in Discrete Mathematics : Encyclopedia of Mathematics and Its Applications - Vladimir N. Sachkov

Combinatorial Methods in Discrete Mathematics

Encyclopedia of Mathematics and Its Applications


Published: 2nd June 2011
RRP $83.95
This title is not in stock at the Booktopia Warehouse and needs to be ordered from our supplier.
Click here to read more about delivery expectations.

Other Available Formats (Hide)

  • Hardcover View Product Published: 26th January 1996

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.

Review of the hardback: ' ... a very enjoyable and brisk introduction to the exciting fields of enumerative and probabilistic combinatorics'. B. Bollobas, Bulletin of the London Mathematical Society
Review of the hardback: ' ... for the serious student of generating functions and asymptotic techniques it provides an account of the work of Kolchin (who did the translation), the author and others which is not otherwise readily available in English.' I. Anderson, Bulletin of the Edinburgh Mathematical Society

Preface to the English edition
Combinatorial configurations
Transversals and permanents
Generating functions
Graphs and mappings
The general combinatorial scheme
Polya's theorem and its applications
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780521172769
ISBN-10: 0521172764
Series: Encyclopedia of Mathematics and Its Applications
Audience: Professional
Format: Paperback
Language: English
Number Of Pages: 322
Published: 2nd June 2011
Publisher: Cambridge University Press
Country of Publication: GB
Dimensions (cm): 23.4 x 15.6  x 1.7
Weight (kg): 0.45