Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Combinatorial Methods in Discrete Mathematics

Combinatorial Methods in Discrete Mathematics

Kolchin, V.
Sachkov, Vladimir Nikolaevich
Sachkov, V.

Hardcover

Series: Encyclopedia of Mathematics and Its Applications, Book 55

General Mathematics

ISBN10: 0521455138
ISBN13: 9780521455138
Publisher: Cambridge University Press
Published: Jan 11 1996
Pages: 324
Weight: 1.40
Height: 0.93 Width: 6.40 Depth: 9.65
Language: English
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.

1 different editions

Also available

Also from

Sachkov, V.

View All

Also in

General Mathematics

View All