Algorithmic algebraic number theory

POHST, M.; ZASSENHAUS, H.

ISBN 10: 052145512X / ISBN 13: 9780521455121

Published by Cambridge University Press, 1989

Encyclopedia of Mathematics and its Applications. xiv, 465 p. 24 cm. Red cloth. Ex library with labels on spine and front cover, ink stamps on top edge and title page. Seller Inventory # 148013

Synopsis:

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.

Book Description: This 1997 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 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.

Bibliographic Details

Title: Algorithmic algebraic number theory
Publisher: Cambridge University Press
Publication Date: 1989
Binding: Hardcover
Condition: ex library-very good