Combinatorial Methods in Discrete Mathematics
Combinatorial Methods in Discrete Mathematics by Vladimir N. Sachkov, V. Kolchin
English | 1996 | ISBN: 0521455138 | 324 Pages | DJVU | 4.4 MB
English | 1996 | ISBN: 0521455138 | 324 Pages | DJVU | 4.4 MB
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.