9780521455138 - Combinatorial Methods in Discrete Mathematics (Encyclopedia of Mathematics & Its Applications) von Sachkov, V.; Sachkov, Vladimir Nikolaevich (6 Ergebnisse)

Hardcover. Zustand: Very Good. Zustand des Schutzumschlags: Very Good. 1st Edition. A very heavy volume that will require additional postage for destinations outside of the USA.

Hardcover. Zustand: Near Fine. Zustand des Schutzumschlags: Near Fine. 1st Edition.

Zustand: New. In English.

Zustand: Sehr gut. 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.

Zustand: New. A 1996 account of some complex problems of discrete mathematics in a simple and unified form. Translator(s): Kolchin, V. F. Series: Encyclopedia of Mathematics and Its Applications. Num Pages: 324 pages, bibliography, index. BIC Classification: PBT; PBV. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 22. Weight in Grams: 631. . 1996. hardcover. . . . . Books ship from the US and Ireland.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Originally published in 1996, this is a presentation of 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 ones 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 3. The general combinatorial scheme is then introduced and in the last 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 chance to update the text and references where appropriate.