Probabilistic Methods in Combinatorial Analysis

Descripción

Druck auf Anfrage Neuware - Printed after ordering - 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.

N° de ref. del artículo 9780521172776

Contactar al vendedor

Denunciar este artículo

Detalles bibliográficos

Título

Probabilistic Methods in Combinatorial Analysis

Editor

Cambridge University Press

Fecha de publicación

2011

Idioma

Inglés

ISBN 10

0521172772

ISBN 13

9780521172776

Encuadernación

Taschenbuch

Estado

Neu

Dimensiones

234 mm an. × 156 al. × 14 l. 234 milímetros de ancho por 156 de alto por 14 de largo

Peso

398 gramos

Acerca de