9780521455138: Combinatorial Methods in Discrete Mathematics

Sinossi

A 1996 account of some complex problems of discrete mathematics in a simple and unified form.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Recensione

Review of the hardback: ' ... a very enjoyable and brisk introduction to the exciting fields of enumerative and probabilistic combinatorics'. B. Bollobás, Bulletin of the London Mathematical Society

Review of the hardback: ' ... for the serious student of generating functions and asymptotic techniques it provides an account of the work of Kolchin (who did the translation), the author and others which is not otherwise readily available in English.' I. Anderson, Bulletin of the Edinburgh Mathematical Society

Descrizione del libro

A 1996 account of some complex problems of discrete mathematics in a simple and unified form. A distinctive aspect of the book is the large number of asymptotic formulae derived. This is an important book, describing many ideas not previously available in English; the author has taken the chance to update the text and references where appropriate.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Altre edizioni note dello stesso titolo

9780521172769: Combinatorial Methods in Discrete Mathematics

Edizione in evidenza

ISBN 10:  0521172764 ISBN 13:  9780521172769
Casa editrice: Cambridge University Press, 2011
Brossura