Probabilistic Methods in Combinatorial Analysis (Hardcover)

This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using such notions as characteristic and generating functions, the moment method and so on but also let us use the powerful technique of limit theorems. The basic objects under investigation are nonnegative matrices, partitions and mappings of finite sets, with special emphasis on permutations and graphs, and equivalence classes specified on sequences of finite length consisting of elements of partially ordered sets; these specify the probabilistic setting of Sachkov's general combinatorial scheme. The author pays special attention to using probabilistic methods to obtain asymptotic formulae that are difficult to derive using combinatorial methods. This was an important book, describing many ideas not previously available in English; the author has taken the chance to rewrite parts of the text and refresh the references where appropriate.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	Encyclopedia of Mathematics and its Applications
Release date:	May 1997
First published:	1997
Authors:	Vladimir N. Sachkov
Translators:	V.A. Vatutin
Dimensions:	241 x 163 x 21mm (L x W x T)
Format:	Hardcover
Pages:	260
ISBN-13:	978-0-521-45512-1
Languages:	English
Subtitles:	Russian
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
LSN:	0-521-45512-X
Barcode:	9780521455121

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!