Probabilistic Methods in Combinatorial Analysis: (Encyclopedia of Mathematics and its Applications)
By
Vladimir N. Sachkov (Author) V. A. Vatutin (Contributor)
Hardback
Available / dispatched within 1 - 2 weeks
Quantity
Description
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.
More Details
- Contributor: Vladimir N. Sachkov
- Imprint: Cambridge University Press
- ISBN13: 9780521455121
- Number of Pages: 260
- Packaged Dimensions: 163x241x21mm
- Packaged Weight: 540
- Format: Hardback
- Publisher: Cambridge University Press
- Release Date: 1997-05-15
- Series: Encyclopedia of Mathematics and its Applications
- Binding: Hardback
Delivery Options
Home Delivery
Store Delivery
Free Returns
We hope you are delighted with everything you buy from us. However, if you are not, we will refund or replace your order up to 30 days after purchase. Terms and exclusions apply; find out more from our Returns and Refunds Policy.