Probabilistic Methods in Combinatorial Analysis

SACHKOV, Vladimir N.

ISBN 10: 052145512X / ISBN 13: 9780521455121

Published by Cambridge University Press, 1997

About this Item

Encyclopedia of Mathematics and its Applications Vol. 56. x, 246 p. 24 cm. Red cloth. Ex library with labels on spine and front cover, ink stamps on top edge and title page.

Seller Inventory # 148008

Bibliographic Details

• Title: Probabilistic Methods in Combinatorial Analysis
• Publisher: Cambridge University Press
• Publication Date: 1997
• ISBN 10: 052145512X
• ISBN 13: 9780521455121
• Binding: Hardcover
• Condition: ex library-very good
• Seller catalogs:
  • Science

About this title

Synopsis

This work explores the role of probabilistic methods for solving combinatorial problems. The subjects studied 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 define 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 important book describes many ideas not previously available in English and will be of interest to graduate students and professionals in mathematics and probability theory.

Book Description

This work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using ideas from probability theory but also let us use the powerful technique of limit theorems. 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.