Encyclopedia of Mathematics and its ApplicationsSeries Number 56- Probabilistic Methods in Combinatorial Analysis

This work explores the role of probabilistic methods for solving combinatorial problems. The author pays special attention to using these methods to obtain asymptotic formulae.



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.

Beschikbaarheid: Op voorraad

Bij ons betaalt u ongeacht de hoeveelheid boeken € 3,95 aan verzendkosten in Nederland.

 

Titel	Encyclopedia of Mathematics and its ApplicationsSeries Number 56- Probabilistic Methods in Combinatorial Analysis
Artikelnummer	9d5b95d1-5333-4b1d-a248-bd691b2cd228
Uitgever	Cambridge University Press
Auteur	Vladimir N. Sachkov
Jaartal	1997
Band	Nee
Druk	N/B
Bladzijden	260
Staat	Als nieuw
Toelichting op staat	Wel naam op schutblad, maar in zeer nette staat!
ISBN-13	9780521455121