Combinatorial Methods in Discrete Mathematics (Encyclopedia of Mathematics and its Applications, nr. 55)

De (autor) Traducere de V. Kolchin
Notă GoodReads:
en Limba Engleză Paperback – 02 Jun 2011
Originally published in 1996, this is a presentation of some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. The author's aim is not always to present the most general results, but rather to focus attention on ones that illustrate the methods described. A distinctive aspect of the book is the large number of asymptotic formulae derived. Professor Sachkov begins with a discussion of block designs and Latin squares before proceeding to treat transversals, devoting much attention to enumerative problems. The main role in these problems is played by generating functions, which are considered in Chapter 3. The general combinatorial scheme is then introduced and in the last chapter Polya's enumerative theory is discussed. 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.
Citește tot Restrânge
Toate formatele și edițiile
Toate formatele și edițiile Preț Express
Paperback (1) 34384 lei  43-55 zile +8750 lei  12-20 zile
  Cambridge University Press – 02 Jun 2011 34384 lei  43-55 zile +8750 lei  12-20 zile
Hardback (1) 59281 lei  43-55 zile +20710 lei  12-20 zile
  Cambridge University Press – 11 Jan 1996 59281 lei  43-55 zile +20710 lei  12-20 zile

Din seria Encyclopedia of Mathematics and its Applications

Preț: 34384 lei

Puncte Express: 516

Preț estimativ în valută:
6676 6836$ 5637£

Carte tipărită la comandă

Livrare economică 23 septembrie-05 octombrie
Livrare express 23-31 august pentru 9749 lei

Preluare comenzi: 021 569.72.76


ISBN-13: 9780521172769
ISBN-10: 0521172764
Pagini: 322
Dimensiuni: 156 x 234 x 17 mm
Greutate: 0.45 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Encyclopedia of Mathematics and its Applications

Locul publicării: Cambridge, United Kingdom


Preface; Preface to the English edition; Introduction; 1. Combinatorial configurations; 2. Transversals and permanents; 3. Generating functions; 4. Graphs and mappings; 5. The general combinatorial scheme; 6. Polya's theorem and its applications; Bibliography; Index.


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