PERHAPS A GIFT VOUCHER FOR MUM?: MOTHER'S DAY

Close Notification

Your cart does not contain any items

Probabilistic Methods in Combinatorial Analysis

Vladimir N. Sachkov V. A. Vatutin

$203.95

Hardback

Not in-store but you can order this
How long will it take?

QTY:

English
Cambridge University Press
14 July 1997
This 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 is 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.

By:  
Translated by:  
Imprint:   Cambridge University Press
Country of Publication:   United Kingdom
Volume:   56
Dimensions:   Height: 242mm,  Width: 165mm,  Spine: 20mm
Weight:   505g
ISBN:   9780521455121
ISBN 10:   052145512X
Series:   Encyclopedia of Mathematics and its Applications
Pages:   260
Publication Date:  
Audience:   Professional and scholarly ,  Undergraduate
Format:   Hardback
Publisher's Status:   Active

See Also